ARTICLES - A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
Year of publication: |
2000
|
---|---|
Authors: | Holmberg, Kaj ; Yuan, Di |
Published in: |
Operations research : the journal of the Operations Research Society of America. - Linthicum, Md : INFORMS, ISSN 0030-364X, ZDB-ID 1233890. - Vol. 48.2000, 3, p. 461-481
|
Saved in:
Saved in favorites
Similar items by person
-
An exact algorithm for the capacitated facility location problems with single sourcing
Holmberg, Kaj, (1999)
-
An exact algorithm for the capacitated facility location problems with single sourcing
Holmberg, Kaj, (1999)
-
A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
Holmberg, Kaj, (2003)
- More ...