Robust discrete spanning tree problem : local search algorithms
Year of publication: |
2022
|
---|---|
Authors: | Sharma, Prabha ; Singh, Sandeep ; Ghosh, Diptesh ; Chandrasekaran, R. |
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, 2, p. 632-644
|
Subject: | Absolute robust tree | Local search | Neighbourhood of a tree | Relative robust tree | Scenario | Weak tree | Worst case scenario | Graphentheorie | Graph theory | Robustes Verfahren | Robust statistics | Mathematische Optimierung | Mathematical programming | Entscheidungsbaum | Decision tree | Algorithmus | Algorithm |
-
Two-stage robust optimization, state-space representable uncertainty and applications
Minoux, Michel, (2014)
-
Algorithms and uncertainty sets for data-driven robust shortest path problems
Chassein, André, (2019)
-
Optimization problems in graphs with locational uncertainty
Bougeret, Marin, (2023)
- More ...
-
A network simplex algorithm with O(n) consecutive degenerate pivots
Ahuja, Ravindra K., (2002)
-
An efficient local search scheme for minimizing mean absolute deviation of completion times
Gupta, Anjulika, (2011)
-
Permutation Polyhedra and Minimisation of the Variance of Completion Times on a Single Machine
Sharma, Prabha, (2002)
- More ...