The SCEAS System
| |||||||

## Search the dblp DataBase
Geir Dahl:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Geir Dahl
**Polyhedra and Optimization in Connection with a Weak Majorization Ordering.**[Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:426-437 [Conf] - Geir Dahl
**Directed Steiner Problems with Connectivity Constraints.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:47, n:2, pp:109-128 [Journal] - Geir Dahl, Truls Flatberg
**Optimization and reconstruction of**[Citation Graph (0, 0)][DBLP]*hv*-convex (0, 1)-matrices. Discrete Applied Mathematics, 2005, v:151, n:1-3, pp:93-105 [Journal] - Geir Dahl, Truls Flatberg
**A remark concerning graphical sequences.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:304, n:1-3, pp:62-64 [Journal] - Geir Dahl, François Margot
**Weak k-majorization and polyhedra.**[Citation Graph (0, 0)][DBLP] Math. Program., 1998, v:81, n:, pp:37-53 [Journal] - Geir Dahl, Bjarne Johannessen
**The 2-path network problem.**[Citation Graph (0, 0)][DBLP] Networks, 2004, v:43, n:3, pp:190-199 [Journal] - Geir Dahl, Bjørnar Realfsen
**The cardinality-constrained shortest path problem in 2-graphs.**[Citation Graph (0, 0)][DBLP] Networks, 2000, v:36, n:1, pp:1-8 [Journal] - Geir Dahl
**The 2-hop spanning tree problem.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1998, v:23, n:1-2, pp:21-26 [Journal] - Geir Dahl
**Polytopes related to the l**[Citation Graph (0, 0)][DBLP]_{infinity}-distance between vectors. Oper. Res. Lett., 1998, v:22, n:1, pp:49-54 [Journal] - Geir Dahl
**Notes on polyhedra associated with hop-constrained paths.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1999, v:25, n:2, pp:97-100 [Journal] - Geir Dahl, Njål Foldnes
**Complete description of a class of knapsack polytopes.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:335-340 [Journal] - Geir Dahl, Njål Foldnes, Luis Gouveia
**A note on hop-constrained walk polytopes.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2004, v:32, n:4, pp:345-349 [Journal] - Geir Dahl, Luis Gouveia
**On the directed hop-constrained shortest path problem.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2004, v:32, n:1, pp:15-22 [Journal] - Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau
**On the**[Citation Graph (0, 0)][DBLP]*k*edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett., 2006, v:34, n:5, pp:577-582 [Journal] - Geir Storvik, Geir Dahl
**Lagrangian-based methods for finding MAP solutions for MRF models.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Image Processing, 2000, v:9, n:3, pp:469-479 [Journal] - Geir Dahl, Truls Flatberg
**Some constrained partitioning problems and majorization.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2004, v:158, n:2, pp:434-443 [Journal] **Methods based on discrete optimization for finding road network rehabilitation strategies.**[Citation Graph (, )][DBLP]**Disjoint congruence classes and a timetabling application.**[Citation Graph (, )][DBLP]
Search in 0.040secs, Finished in 0.041secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |