The following pages link to Dag Haugland (Q249508):
Displaying 37 items.
- Pooling problems with polynomial-time algorithms (Q306403) (← links)
- Optimization methods for pipeline transportation of natural gas with variable specific gravity and compressibility (Q384516) (← links)
- A cost minimization heuristic for the pooling problem (Q490199) (← links)
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- Local search methods for \(\ell_{1}\)-minimization in frame based signal compression (Q833415) (← links)
- Designing delivery districts for the vehicle routing problem with stochastic demands (Q872114) (← links)
- New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm (Q987839) (← links)
- A fast local search method for minimum energy broadcast in wireless ad hoc networks (Q1015298) (← links)
- Models for petroleum field exploitation (Q1104874) (← links)
- Solving many linear programs that differ only in the right-hand side (Q1108193) (← links)
- Minimizing the tracking error of cardinality constrained portfolios (Q1652503) (← links)
- Strategic optimization of offshore wind farm installation (Q1691680) (← links)
- Obstacle-aware optimization of offshore wind farm cable layouts (Q1730635) (← links)
- (Q1879782) (redirect page) (← links)
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope (Q2056893) (← links)
- Integer programming formulations for the shared multicast tree problem (Q2331596) (← links)
- A multi-commodity flow formulation for the generalized pooling problem (Q2392115) (← links)
- Strong formulations for the pooling problem (Q2392127) (← links)
- Comparison of Discrete and Continuous Models for the Pooling Problem (Q2917266) (← links)
- (Q3142439) (← links)
- Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks (Q3528150) (← links)
- Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization (Q3540932) (← links)
- Feasibility Testing for Dial-a-Ride Problems (Q3578371) (← links)
- Improved Time Complexities of Algorithms for the Directional Minimum Energy Broadcast Problem (Q3627743) (← links)
- (Q4233351) (← links)
- A bilinear approach to the pooling problem† (Q4327911) (← links)
- Fast Methods for the Index Tracking Problem (Q4685761) (← links)
- Parallel algorithms for the maximum flow problem with minimum lot sizes (Q5176286) (← links)
- An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms (Q5356966) (← links)
- A Bidirectional Greedy Heuristic for the Subspace Selection Problem (Q5429297) (← links)
- The computational complexity of the pooling problem (Q5964238) (← links)
- Optimization of reliable cyclic cable layouts in offshore wind farms (Q6094298) (← links)
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)
- Tighter bounds on the minimum broadcast time (Q6122083) (← links)
- Strong bounds and exact solutions to the minimum broadcast time problem (Q6609717) (← links)
