Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
Year of publication: |
2010
|
---|---|
Authors: | Mohan, Srimathy ; Gendreau, Michel ; Rousseau, Jean-Marc |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 203.2010, 1 (16.5.), p. 50-59
|
Saved in:
Saved in favorites
Similar items by person
-
Heuristics for the Stochastic Eulerian Tour Problem
Mohan, Srimathy, (2010)
-
The Stochastic Eulerian Tour Problem
Mohan, Srimathy, (2008)
-
Heuristics for the stochastic Eulerian tour problem
Mohan, Srimathy, (2010)
- More ...