default search action
Dag Haugland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j23]Marika Ivanová
, Dag Haugland, Bård Hennning Tvedt:
Strong bounds and exact solutions to the minimum broadcast time problem. Int. Trans. Oper. Res. 32(1): 314-352 (2025) - 2024
- [j22]Dag Haugland
Tighter bounds on the minimum broadcast time. Discret. Optim. 51: 100822 (2024) - 2023
- [j21]Phillippe Samer
Polyhedral results and stronger Lagrangean bounds for stable spanning trees. Optim. Lett. 17(6): 1317-1335 (2023) - 2022
- [c19]Phillippe Samer
Towards Stronger Lagrangean Bounds for Stable Spanning Trees. INOC 2022: 1-5 - [i1]Phillippe Samer
Polyhedral results and stronger Lagrangean bounds for stable spanning trees. CoRR abs/2208.13014 (2022) - 2021
- [j20]Phillippe Samer
Fixed cardinality stable sets. Discret. Appl. Math. 303: 137-148 (2021)
2010 – 2019
- 2019
- [j19]Arne Klein, Dag Haugland
Obstacle-aware optimization of offshore wind farm cable layouts. Ann. Oper. Res. 272(1-2): 373-388 (2019) - [j18]Alejandro Gutierrez Alcoba
On offshore wind farm maintenance scheduling for decision support on vessel fleet composition. Eur. J. Oper. Res. 279(1): 124-131 (2019) - [j17]Marika Ivanová, Dag Haugland
Integer programming formulations for the shared multicast tree problem. J. Comb. Optim. 38(3): 927-956 (2019) - [c18]Dag Haugland:
Pooling Problems with Single-Flow Constraints. INOC 2019: 95-100 - 2018
- [j16]Purity Mutunge, Dag Haugland
Minimizing the tracking error of cardinality constrained portfolios. Comput. Oper. Res. 90: 33-41 (2018) - 2017
- [c17]Alejandro Gutierrez Alcoba
A model for optimal fleet composition of vessels for offshore wind farm maintenance. ICCS 2017: 1512-1521 - [c16]Stian Backe
Strategic Optimization of Offshore Wind Farm Installation. ICCL 2017: 285-299 - [c15]Dag Haugland:
Fast Methods for the Index Tracking Problem. OR 2017: 277-283 - 2016
- [j15]Dag Haugland
The computational complexity of the pooling problem. J. Glob. Optim. 64(2): 199-215 (2016) - [j14]Dag Haugland
Pooling Problems with Polynomial-Time Algorithms. J. Optim. Theory Appl. 170(2): 591-615 (2016) - 2015
- [c14]Dag Haugland
On a Pooling Problem with Fixed Network Size. ICCL 2015: 328-342 - [c13]Arne Klein, Dag Haugland
An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms. MCO (1) 2015: 27-36 - 2014
- [j13]Mohammed Alfaki, Dag Haugland
A cost minimization heuristic for the pooling problem. Ann. Oper. Res. 222(1): 73-87 (2014) - 2013
- [j12]Mohammed Alfaki, Dag Haugland
Strong formulations for the pooling problem. J. Glob. Optim. 56(3): 897-916 (2013) - [j11]Mohammed Alfaki, Dag Haugland
A multi-commodity flow formulation for the generalized pooling problem. J. Glob. Optim. 56(3): 917-937 (2013) - 2012
- [j10]Di Yuan, Dag Haugland
Dual Decomposition for Computational Optimization of Minimum-Power Shared Broadcast Tree in Wireless Networks. IEEE Trans. Mob. Comput. 11(12): 2008-2019 (2012) - 2011
- [j9]Conrado Borraz-Sánchez, Dag Haugland
Minimizing fuel cost in gas transmission networks by dynamic programming and adaptive discretization. Comput. Ind. Eng. 61(2): 364-372 (2011) - [j8]Sin C. Ho
Local search heuristics for the probabilistic dial-a-ride problem. OR Spectr. 33(4): 961-988 (2011) - [c12]Mohammed Alfaki, Dag Haugland
Comparison of discrete and continuous models for the pooling problem. ATMOS 2011: 112-121 - [c11]Dag Haugland
The Maximum Flow Problem with Minimum Lot Sizes. ICCL 2011: 170-182 - [c10]Mujahed Eleyat, Dag Haugland, Magnus Lie Hetland, Lasse Natvig:
Parallel algorithms for the maximum flow problem with minimum lot sizes. OR 2011: 83-88 - 2010
- [j7]Joanna Bauer, Kemal Altinkemer, Dag Haugland
Center-oriented algorithms for the minimum energy broad and multicast problem in wireless ad hoc networks. Electron. Commer. Res. Appl. 9(3): 228-236 (2010) - [c9]Dag Haugland
Feasibility Testing for Dial-a-Ride Problems. AAIM 2010: 170-179 - [c8]Mohammad Ravanbakhsh, Dag Haugland
Methods for Flow Graph Selection in Integral Network Coding. AICT 2010: 292-297
2000 – 2009
- 2009
- [j6]Joanna Bauer, Dag Haugland
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm. Inf. Process. Lett. 109(12): 615-619 (2009) - [j5]Joanna Bauer, Dag Haugland
A fast local search method for minimum energy broadcast in wireless ad hoc networks. Oper. Res. Lett. 37(2): 75-79 (2009) - 2008
- [j4]Di Yuan, Joanna Bauer, Dag Haugland
Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms. Ad Hoc Networks 6(5): 696-717 (2008) - [j3]Joanna Bauer, Dag Haugland
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks. Networks 52(2): 57-68 (2008) - [c7]Mohammad Ravanbakhsh, Mehdi M. Hassanzadeh, Dag Haugland
Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization. ICMCTA 2008: 154-162 - [c6]Joanna Bauer, Dag Haugland
Improved Time Complexities of Algorithms for the Directional Minimum Energy Broadcast Problem. MCO 2008: 488-496 - 2007
- [j2]Dag Haugland
Designing delivery districts for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 180(3): 997-1010 (2007) - [c5]Dag Haugland
A Bidirectional Greedy Heuristic for the Subspace Selection Problem. SLS 2007: 162-176 - 2004
- [j1]Sin C. Ho
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12): 1947-1964 (2004)
1990 – 1999
- 1999
- [c4]Ranveig Nygaard, John Håkon Husøy, Dag Haugland, Sven Ole Aase:
Signal compression by piecewise linear non-interpolating approximation. ICASSP 1999: 1273-1276 - 1998
- [c3]Ranveig Nygaard, Dag Haugland, Hgskolen i Stavanger:
Complete coding scheme using optimal time domain ECG compression methods. EUSIPCO 1998: 1-4 - [c2]Ranveig Nygaard, Dag Haugland
Compressing ECG signals by piecewise polynomial approximation. ICASSP 1998: 1809-1812 - [c1]Ranveig Nygaard, John Håkon Husøy, Dag Haugland:
Compression of Image Contours using Combinatorial Optimization. ICIP (1) 1998: 266-270
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: