Design of a min-sum arborescence with outage costs
Year of publication: |
2013
|
---|---|
Authors: | Kawatra, Rakesh |
Published in: |
Review of business information systems. - Littleton, Colo. : [Verlag nicht ermittelbar], ISSN 1534-665X, ZDB-ID 2442108-X. - Vol. 17.2013, 3, p. 127-133
|
Subject: | Integer Programming | Heuristics | Arborescence | Networks | Heuristik | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Kosten | Costs | Mathematische Optimierung | Mathematical programming |
-
A hybrid modified-NSGA-II VNS algorithm for the Multi-Objective Critical Disruption Path Problem
Granata, Donatella, (2023)
-
On exact solution approaches for the longest induced path problem
Matsypura, Dmytro, (2019)
-
Design of capacitated degree constrained min-sum arborescence
Kawatra, Rakesh, (2022)
- 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 ...