Robust discrete spanning tree problem: local search algorithms

DOI10.1007/s12597-021-00538-0OpenAlexW3189841424MaRDI QIDQ2085475

R. Chandrasekaran, Prabha Sharma, Sandeep Singh, Diptesh Ghosh

Publication date: 18 October 2022

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-021-00538-0

zbMATH Keywords

local searchscenarioworst case scenarioabsolute robust treeneighbourhood of a treerelative robust treeweak tree

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• On exact solutions for the minmax regret spanning tree problem
• A branch and bound algorithm for the robust spanning tree problem with interval data
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• On the complexity of the robust spanning tree problem with interval data
• A Benders decomposition approach for the robust spanning tree problem with interval data
• The robust spanning tree problem with interval data

This page was built for publication: Robust discrete spanning tree problem: local search algorithms