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 : transactions in operations research. - [Berlin] : Springer, ISSN 1134-5764, ZDB-ID 1205918-3. - Vol. 18.2010, 1, p. 140-157
|
Subject: | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Hosseinian, Seyedmohammadhossein, (2020)
-
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Deza, Michel, (2016)
- More ...
-
Tight bounds from a path based formulation for the tree of hub location problem
Contreras, Ivan, (2009)
-
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 ...