A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
Year of publication: |
1998
|
---|---|
Authors: | Dahl, Geir ; Stoer, Mechthild |
Published in: |
INFORMS journal on computing : JOC. - Linthicum, Md : INFORMS, ISSN 0899-1499, ZDB-ID 13160771. - Vol. 10.1998, 1, p. 1-11
|
Saved in:
Saved in favorites
Similar items by person
-
IN THIS ISSUE - ARTICLES - Routing Through Virtual Paths in Layered Telecommunication Networks
Dahl, Geir, (1999)
-
Some constrained partitioning problems and majorization
Dahl, Geir, (2004)
-
On the directed hop-constrained shortest path problem
Dahl, Geir, (2004)
- More ...