Lagrangean bounds for the optimum communication spanning tree problem
Year of publication: |
2010
|
---|---|
Authors: | Contreras, Ivan ; Fernández, Elena ; Marín, Alfredo |
Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 18.2010, 1, p. 140-157
|
Publisher: |
Springer |
Subject: | Network design | Lagrangean relaxation | Heuristics |
-
Nassief, W., (2016)
-
Kimms, Alf, (1999)
-
Scheduling and combinatorial auctions: Lagrangean relaxation-based bonds for the WJISP
Elendner, Thomas, (2003)
- More ...
-
The Tree of Hubs Location Problem
Contreras, Ivan, (2010)
-
A cooperative local search-based algorithm for the Multiple-Scenario Max–Min Knapsack Problem
Contreras, Ivan, (2010)
-
Lagrangean bounds for the optimum communication spanning tree problem
Contreras, Ivan, (2010)
- More ...