Dag Haugland

From MaRDI portal
Revision as of 20:17, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Dag Haugland to Dag Haugland: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:249508

Available identifiers

zbMath Open haugland.dagWikidataQ102343944 ScholiaQ102343944MaRDI QIDQ249508

List of research outcomes





PublicationDate of PublicationType
Strong bounds and exact solutions to the minimum broadcast time problem2024-09-24Paper
Tighter bounds on the minimum broadcast time2024-03-27Paper
Optimization of reliable cyclic cable layouts in offshore wind farms2023-10-10Paper
Polyhedral results and stronger Lagrangean bounds for stable spanning trees2023-07-06Paper
The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope2021-12-08Paper
Fixed cardinality stable sets2021-09-15Paper
Strong bounds and exact solutions to the minimum broadcast time problem2021-07-13Paper
Integer programming formulations for the shared multicast tree problem2019-10-29Paper
Obstacle-aware optimization of offshore wind farm cable layouts2019-03-06Paper
Fast Methods for the Index Tracking Problem2018-10-09Paper
Minimizing the tracking error of cardinality constrained portfolios2018-07-11Paper
Strategic optimization of offshore wind farm installation2018-01-25Paper
An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms2017-09-12Paper
Pooling problems with polynomial-time algorithms2016-08-31Paper
The computational complexity of the pooling problem2016-02-29Paper
Parallel algorithms for the maximum flow problem with minimum lot sizes2015-03-03Paper
A cost minimization heuristic for the pooling problem2015-01-22Paper
Optimization methods for pipeline transportation of natural gas with variable specific gravity and compressibility2013-11-28Paper
A multi-commodity flow formulation for the generalized pooling problem2013-08-01Paper
Strong formulations for the pooling problem2013-08-01Paper
Comparison of Discrete and Continuous Models for the Pooling Problem2012-09-28Paper
Local search heuristics for the probabilistic dial-a-ride problem2012-01-13Paper
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm2010-08-16Paper
Feasibility Testing for Dial-a-Ride Problems2010-07-20Paper
Local search methods for \(\ell_{1}\)-minimization in frame based signal compression2009-08-12Paper
Improved Time Complexities of Algorithms for the Directional Minimum Energy Broadcast Problem2009-05-13Paper
A fast local search method for minimum energy broadcast in wireless ad hoc networks2009-05-07Paper
Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization2008-11-25Paper
Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks2008-10-08Paper
A Bidirectional Greedy Heuristic for the Subspace Selection Problem2007-11-29Paper
Designing delivery districts for the vehicle routing problem with stochastic demands2007-03-27Paper
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries2004-09-23Paper
https://portal.mardi4nfdi.de/entity/Q42333511999-03-16Paper
A bilinear approach to the pooling problem†1995-03-27Paper
https://portal.mardi4nfdi.de/entity/Q31424391993-12-12Paper
Models for petroleum field exploitation1988-01-01Paper
Solving many linear programs that differ only in the right-hand side1988-01-01Paper

Research outcomes over time

This page was built for person: Dag Haugland