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 | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics | Graphentheorie | Graph theory | Entscheidungsbaum | Decision tree |
-
Robust maximum weighted independent-set problems on interval graphs
Talla Nobibon, Fabrice, (2011)
-
Robust Maximum Weighted Independent-Set Problems on Interval Graphs
Nobibon, F. Talla, (2011)
-
A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
Nogueira, Bruno, (2018)
- More ...
-
An efficient heuristic algorithm for the bottleneck traveling salesman problem
Ramakrishnan, Ravi, (2009)
-
Symmetric weight constrained traveling salesman problem : local search
Gahir, Dharmananda, (2010)
-
An efficient local search for minimizing completion time variance in permutation flow shops
Mehta, Peeyush, (2012)
- More ...