Dag Haugland

44 papers C 4Misc 3Journal 25Unranked 12
YearRankTypeTitle / Venue / Authors
2026 J jnl
Broadcasting two messages in wheel graphs.
Discret. Appl. Math.
Mikolaj Cuszynski-Kruk, Dag Haugland
2025 J jnl
Strong bounds and exact solutions to the minimum broadcast time problem.
Int. Trans. Oper. Res.
Marika Ivanová, Dag Haugland, Bård Hennning Tvedt
2024 J jnl
Tighter bounds on the minimum broadcast time.
Discret. Optim.
Dag Haugland
2023 J jnl
Polyhedral results and stronger Lagrangean bounds for stable spanning trees.
Optim. Lett.
Phillippe Samer, Dag Haugland
2022 J jnl
Polyhedral results and stronger Lagrangean bounds for stable spanning trees.
CoRR
Phillippe Samer, Dag Haugland
2022 C conf
Towards Stronger Lagrangean Bounds for Stable Spanning Trees.
INOC
Phillippe Samer, Dag Haugland
2021 J jnl
Fixed cardinality stable sets.
Discret. Appl. Math.
Phillippe Samer, Dag Haugland
2019 J jnl
Integer programming formulations for the shared multicast tree problem.
J. Comb. Optim.
Marika Ivanová, Dag Haugland
2019 J jnl
Obstacle-aware optimization of offshore wind farm cable layouts.
Ann. Oper. Res.
Arne Klein, Dag Haugland
2019 J jnl
On offshore wind farm maintenance scheduling for decision support on vessel fleet composition.
Eur. J. Oper. Res.
Alejandro Gutierrez Alcoba, Eligius M. T. Hendrix, Gloria Ortega López, Elin E. Halvorsen-Weare, Dag Haugland
2019 C conf
Pooling Problems with Single-Flow Constraints.
INOC
Dag Haugland
2018 J jnl
Minimizing the tracking error of cardinality constrained portfolios.
Comput. Oper. Res.
Purity Mutunge, Dag Haugland
2017 Misc conf
A model for optimal fleet composition of vessels for offshore wind farm maintenance.
ICCS
Alejandro Gutierrez Alcoba, Gloria Ortega López, Eligius M. T. Hendrix, Elin E. Halvorsen-Weare, Dag Haugland
2017 — conf
Fast Methods for the Index Tracking Problem.
OR
Dag Haugland
2017 — conf
Strategic Optimization of Offshore Wind Farm Installation.
ICCL
Stian Backe, Dag Haugland
2016 J jnl
Pooling Problems with Polynomial-Time Algorithms.
J. Optim. Theory Appl.
Dag Haugland, Eligius M. T. Hendrix
2016 J jnl
The computational complexity of the pooling problem.
J. Glob. Optim.
Dag Haugland
2015 — conf
An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms.
MCO (1)
Arne Klein, Dag Haugland, Joanna Bauer, Mario Mommer
2015 — conf
On a Pooling Problem with Fixed Network Size.
ICCL
Dag Haugland, Eligius M. T. Hendrix
2014 J jnl
A cost minimization heuristic for the pooling problem.
Ann. Oper. Res.
Mohammed Alfaki, Dag Haugland
2013 J jnl
A multi-commodity flow formulation for the generalized pooling problem.
J. Glob. Optim.
Mohammed Alfaki, Dag Haugland
2013 J jnl
Strong formulations for the pooling problem.
J. Glob. Optim.
Mohammed Alfaki, Dag Haugland
2012 J jnl
Dual Decomposition for Computational Optimization of Minimum-Power Shared Broadcast Tree in Wireless Networks.
IEEE Trans. Mob. Comput.
Di Yuan, Dag Haugland
2011 C conf
Comparison of discrete and continuous models for the pooling problem.
ATMOS
Mohammed Alfaki, Dag Haugland
2011 J jnl
Local search heuristics for the probabilistic dial-a-ride problem.
OR Spectr.
Sin C. Ho, Dag Haugland
2011 J jnl
Minimizing fuel cost in gas transmission networks by dynamic programming and adaptive discretization.
Comput. Ind. Eng.
Conrado Borraz-Sánchez, Dag Haugland
2011 — conf
Parallel algorithms for the maximum flow problem with minimum lot sizes.
OR
Mujahed Eleyat, Dag Haugland, Magnus Lie Hetland, Lasse Natvig
2011 — conf
The Maximum Flow Problem with Minimum Lot Sizes.
ICCL
Dag Haugland, Mujahed Eleyat, Magnus Lie Hetland
2010 J jnl
Center-oriented algorithms for the minimum energy broad and multicast problem in wireless ad hoc networks.
Electron. Commer. Res. Appl.
Joanna Bauer, Kemal Altinkemer, Dag Haugland
2010 C conf
Feasibility Testing for Dial-a-Ride Problems.
AAIM
Dag Haugland, Sin C. Ho
2010 — conf
Methods for Flow Graph Selection in Integral Network Coding.
AICT
Mohammad Ravanbakhsh, Dag Haugland
2009 J jnl
A fast local search method for minimum energy broadcast in wireless ad hoc networks.
Oper. Res. Lett.
Joanna Bauer, Dag Haugland, Di Yuan
2009 J jnl
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm.
Inf. Process. Lett.
Joanna Bauer, Dag Haugland, Di Yuan
2008 J jnl
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks.
Networks
Joanna Bauer, Dag Haugland, Di Yuan
2008 — conf
Improved Time Complexities of Algorithms for the Directional Minimum Energy Broadcast Problem.
MCO
Joanna Bauer, Dag Haugland
2008 J jnl
Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms.
Ad Hoc Networks
Di Yuan, Joanna Bauer, Dag Haugland
2008 — conf
Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization.
ICMCTA
Mohammad Ravanbakhsh, Mehdi M. Hassanzadeh, Dag Haugland
2007 — conf
A Bidirectional Greedy Heuristic for the Subspace Selection Problem.
SLS
Dag Haugland
2007 J jnl
Designing delivery districts for the vehicle routing problem with stochastic demands.
Eur. J. Oper. Res.
Dag Haugland, Sin C. Ho, Gilbert Laporte
2004 J jnl
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries.
Comput. Oper. Res.
Sin C. Ho, Dag Haugland
1999 Misc conf
Signal compression by piecewise linear non-interpolating approximation.
ICASSP
Ranveig Nygaard, John Håkon Husøy, Dag Haugland, Sven Ole Aase
1998 — conf
Complete coding scheme using optimal time domain ECG compression methods.
EUSIPCO
Ranveig Nygaard, Dag Haugland, Hgskolen i Stavanger
1998 Misc conf
Compressing ECG signals by piecewise polynomial approximation.
ICASSP
Ranveig Nygaard, Dag Haugland
1998 — conf
Compression of Image Contours using Combinatorial Optimization.
ICIP (1)
Ranveig Nygaard, John Håkon Husøy, Dag Haugland