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 |
-
Algorithms and uncertainty sets for data-driven robust shortest path problems
Chassein, André, (2019)
-
Two-stage robust optimization, state-space representable uncertainty and applications
Minoux, Michel, (2014)
-
Optimization problems in graphs with locational uncertainty
Bougeret, Marin, (2023)
- More ...
-
Identifying defective network components through restricted group testing
Ghosh, Diptesh, (2019)
-
Allocating tools to index positions in tool magazines using tabu search
Ghosh, Diptesh, (2016)
-
A quadratic programming formulation of the equidistant bi-directional loop layout problem
Ghosh, Diptesh, (2015)
- More ...