A lagrangean heuristic for the degree constrained minimal spanning tree problem
Year of publication: |
2010
|
---|---|
Authors: | Kawatra, Rakesh |
Published in: |
Review of business information systems. - Littleton, Colo. : [Verlag nicht ermittelbar], ISSN 1534-665X, ZDB-ID 2442108-X. - Vol. 14.2010, 3, p. 19-24
|
Subject: | Heuristik | Heuristics | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
An effective hybrid search method for the quadratic knapsack problem with conflict graphs
Zhou, Qing, (2024)
-
Multiobjective shortest path problems with lexicographic goal-based preferences
Javier Pulido, Francisco, (2014)
-
Optimal capacitated ring trees
Hill, Alessandro, (2016)
- More ...
-
Kawatra, Rakesh, (1991)
-
TWO-PHASE HEURISTIC FOR CAPACITATED DEGREE CONSTRAINED MIN-SUM ARBORESCENCE
Kawatra, Rakesh, (2014)
-
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs
Kawatra, Rakesh, (2004)
- More ...