Narrow search
Showing 1 - 7 of 7
Cover Image
On the directed hop-constrained shortest path problem
Dahl, Geir; Gouveia, Luis - In: Operations research letters 32 (2004) 1, pp. 15-22
Persistent link: https://www.econbiz.de/10006819253
Cover Image
Complete description of a class of knapsack polytopes
Dahl, Geir; Foldnes, Njål - In: Operations research letters 31 (2003) 5, pp. 335-340
Persistent link: https://www.econbiz.de/10006821528
Cover Image
The 2-hop spanning tree problem
Dahl, Geir - In: Operations research letters 23 (1998) 1, pp. 21-26
Persistent link: https://www.econbiz.de/10006845397
Cover Image
Polytopes related to the l(infinity)-distance between vectors
Dahl, Geir - In: Operations research letters 22 (1997) 1, pp. 49
Persistent link: https://www.econbiz.de/10006849575
Cover Image
A note on hop-constrained walk polytopes
Dahl, Geir; Foldnes, Njål; Gouveia, Luis - In: Operations research letters 32 (2004) 4, pp. 345-349
Persistent link: https://www.econbiz.de/10006817844
Cover Image
On the edge-disjoint 2-hop-constrained paths polytope
Dahl, Geir; Huygens, David; Mahjoub, A.Ridha; Pesneau, … - In: Operations research letters 34 (2006) 5, pp. 577-582
Persistent link: https://www.econbiz.de/10007266994
Cover Image
The stable set problem and the thinness of a graph
Mannino, Carlo; Oriolo, Gianpaolo; Ricci, Federico; … - In: Operations research letters 35 (2007) 1, pp. 1-9
Persistent link: https://www.econbiz.de/10007392203