Design of capacitated degree constrained min-sum arborescence
Year of publication: |
2022
|
---|---|
Authors: | Kawatra, Rakesh |
Published in: |
Opsearch : journal of the Operational Research Society of India. - New Delhi : Springer India, ISSN 0975-0320, ZDB-ID 2516085-0. - Vol. 59.2022, 3, p. 1038-1054
|
Subject: | Heuristics | Integer programming | Lagrangian relaxation | Networks | Mathematische Optimierung | Mathematical programming | Heuristik | Theorie | Theory | Ganzzahlige Optimierung |
-
Matheuristics : survey and synthesis
Boschetti, Marco A., (2023)
-
Akartunalı, Kerem, (2015)
-
An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
Diabat, Ali, (2015)
- More ...
-
Dutta, Amitava, (1994)
-
A multiperiod degree constrained minimal spanning tree problem
Kawatra, Rakesh, (2002)
-
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs
Kawatra, Rakesh, (2004)
- More ...