Dag Haugland

Orcid: 0000-0003-1110-3382

According to our database1, Dag Haugland authored at least 42 papers between 1998 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Strong bounds and exact solutions to the minimum broadcast time problem.
Int. Trans. Oper. Res., January, 2025

2024
Tighter bounds on the minimum broadcast time.
Discret. Optim., 2024

2023
Polyhedral results and stronger Lagrangean bounds for stable spanning trees.
Optim. Lett., July, 2023

2022
Towards Stronger Lagrangean Bounds for Stable Spanning Trees.
Proceedings of the 10th International Network Optimization Conference, 2022

2021
Fixed cardinality stable sets.
Discret. Appl. Math., 2021

2019
Integer programming formulations for the shared multicast tree problem.
J. Comb. Optim., 2019

On offshore wind farm maintenance scheduling for decision support on vessel fleet composition.
Eur. J. Oper. Res., 2019

Obstacle-aware optimization of offshore wind farm cable layouts.
Ann. Oper. Res., 2019

Pooling Problems with Single-Flow Constraints.
Proceedings of the 9th International Network Optimization Conference, 2019

2018
Minimizing the tracking error of cardinality constrained portfolios.
Comput. Oper. Res., 2018

2017
Fast Methods for the Index Tracking Problem.
Proceedings of the Operations Research Proceedings 2017, 2017

Strategic Optimization of Offshore Wind Farm Installation.
Proceedings of the Computational Logistics - 8th International Conference, 2017

A model for optimal fleet composition of vessels for offshore wind farm maintenance.
Proceedings of the International Conference on Computational Science, 2017

2016
Pooling Problems with Polynomial-Time Algorithms.
J. Optim. Theory Appl., 2016

The computational complexity of the pooling problem.
J. Glob. Optim., 2016

2015
An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

On a Pooling Problem with Fixed Network Size.
Proceedings of the Computational Logistics - 6th International Conference, 2015

2014
A cost minimization heuristic for the pooling problem.
Ann. Oper. Res., 2014

2013
A multi-commodity flow formulation for the generalized pooling problem.
J. Glob. Optim., 2013

Strong formulations for the pooling problem.
J. Glob. Optim., 2013

2012
Dual Decomposition for Computational Optimization of Minimum-Power Shared Broadcast Tree in Wireless Networks.
IEEE Trans. Mob. Comput., 2012

2011
Local search heuristics for the probabilistic dial-a-ride problem.
OR Spectr., 2011

Minimizing fuel cost in gas transmission networks by dynamic programming and adaptive discretization.
Comput. Ind. Eng., 2011

Parallel algorithms for the maximum flow problem with minimum lot sizes.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

The Maximum Flow Problem with Minimum Lot Sizes.
Proceedings of the Computational Logistics - Second International Conference, 2011

Comparison of discrete and continuous models for the pooling problem.
Proceedings of the ATMOS 2011, 2011

2010
Center-oriented algorithms for the minimum energy broad and multicast problem in wireless ad hoc networks.
Electron. Commer. Res. Appl., 2010

Methods for Flow Graph Selection in Integral Network Coding.
Proceedings of the Sixth Advanced International Conference on Telecommunications, 2010

Feasibility Testing for Dial-a-Ride Problems.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
A fast local search method for minimum energy broadcast in wireless ad hoc networks.
Oper. Res. Lett., 2009

New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm.
Inf. Process. Lett., 2009

2008
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks.
Networks, 2008

Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms.
Ad Hoc Networks, 2008

Improved Time Complexities of Algorithms for the Directional Minimum Energy Broadcast Problem.
Proceedings of the Modelling, 2008

Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007
Designing delivery districts for the vehicle routing problem with stochastic demands.
Eur. J. Oper. Res., 2007

A Bidirectional Greedy Heuristic for the Subspace Selection Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

2004
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries.
Comput. Oper. Res., 2004

1999
Signal compression by piecewise linear non-interpolating approximation.
Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

1998
Compression of Image Contours using Combinatorial Optimization.
Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

Compressing ECG signals by piecewise polynomial approximation.
Proceedings of the 1998 IEEE International Conference on Acoustics, 1998

Complete coding scheme using optimal time domain ECG compression methods.
Proceedings of the 9th European Signal Processing Conference, 1998


  Loading...