| 2009 |
|---|
| 23 | EE | Michael O. Ball,
Geir Dahl,
Thomas Vossen:
Matchings in connection with ground delay program planning.
Networks 53(3): 293-306 (2009) |
| 2008 |
|---|
| 22 | EE | Geir Dahl,
Harald Minken:
Methods based on discrete optimization for finding road network rehabilitation strategies.
Computers & OR 35(7): 2193-2208 (2008) |
| 2007 |
|---|
| 21 | EE | Geir Dahl:
A note on a parameter relating traffic equilibria and system optimal routing.
Applied Mathematics and Computation 191(2): 445-450 (2007) |
| 20 | EE | Geir Dahl:
Majorization and distances in trees.
Networks 50(4): 251-257 (2007) |
| 2006 |
|---|
| 19 | EE | Geir Dahl,
Njål Foldnes:
LP based heuristics for the multiple knapsack problem with assignment restrictions.
Annals OR 146(1): 91-104 (2006) |
| 18 | EE | Geir Dahl,
David Huygens,
Ali Ridha Mahjoub,
Pierre Pesneau:
On the k edge-disjoint 2-hop-constrained paths polytope.
Oper. Res. Lett. 34(5): 577-582 (2006) |
| 2005 |
|---|
| 17 | EE | Geir Dahl,
Truls Flatberg:
Optimization and reconstruction of hv-convex (0, 1)-matrices.
Discrete Applied Mathematics 151(1-3): 93-105 (2005) |
| 16 | EE | Geir Dahl,
Truls Flatberg:
A remark concerning graphical sequences.
Discrete Mathematics 304(1-3): 62-64 (2005) |
| 15 | EE | Geir Dahl,
Richard A. Brualdi:
Matrices of zeros and ones with given line sums and a zero block.
Electronic Notes in Discrete Mathematics 20: 83-97 (2005) |
| 2004 |
|---|
| 14 | EE | Geir Dahl,
Truls Flatberg:
Some constrained partitioning problems and majorization.
European Journal of Operational Research 158(2): 434-443 (2004) |
| 13 | EE | Geir Dahl,
Bjarne Johannessen:
The 2-path network problem.
Networks 43(3): 190-199 (2004) |
| 12 | EE | Geir Dahl,
Luis Gouveia:
On the directed hop-constrained shortest path problem.
Oper. Res. Lett. 32(1): 15-22 (2004) |
| 11 | EE | Geir Dahl,
Njål Foldnes,
Luis Gouveia:
A note on hop-constrained walk polytopes.
Oper. Res. Lett. 32(4): 345-349 (2004) |
| 2003 |
|---|
| 10 | EE | Geir Dahl,
Truls Flatberg:
Optimization and reconstruction of hv-convex (0, 1)-matrices.
Electronic Notes in Discrete Mathematics 12: 58-69 (2003) |
| 9 | EE | Geir Dahl,
Njål Foldnes:
Complete description of a class of knapsack polytopes.
Oper. Res. Lett. 31(3): 335-340 (2003) |
| 2000 |
|---|
| 8 | EE | Geir Storvik,
Geir Dahl:
Lagrangian-based methods for finding MAP solutions for MRF models.
IEEE Transactions on Image Processing 9(3): 469-479 (2000) |
| 7 | EE | Geir Dahl,
Bjørnar Realfsen:
The cardinality-constrained shortest path problem in 2-graphs.
Networks 36(1): 1-8 (2000) |
| 1999 |
|---|
| 6 | EE | Geir Dahl:
Notes on polyhedra associated with hop-constrained paths.
Oper. Res. Lett. 25(2): 97-100 (1999) |
| 1998 |
|---|
| 5 | | Geir Dahl,
François Margot:
Weak k-majorization and polyhedra.
Math. Program. 81: 37-53 (1998) |
| 4 | EE | Geir Dahl:
Polytopes related to the linfinity-distance between vectors.
Oper. Res. Lett. 22(1): 49-54 (1998) |
| 3 | EE | Geir Dahl:
The 2-hop spanning tree problem.
Oper. Res. Lett. 23(1-2): 21-26 (1998) |
| 1995 |
|---|
| 2 | | Geir Dahl:
Polyhedra and Optimization in Connection with a Weak Majorization Ordering.
IPCO 1995: 426-437 |
| 1993 |
|---|
| 1 | EE | Geir Dahl:
Directed Steiner Problems with Connectivity Constraints.
Discrete Applied Mathematics 47(2): 109-128 (1993) |
