Robust discrete spanning tree problem: local search algorithms
type: Item
instance of: scholarly article
title: Robust discrete spanning tree problem: local search algorithms
author: Prabha Sharma
author: S. Singh
author: Diptesh Ghosh
author: R. Chandrasekaran
published in: Opsearch
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7603414
zbMATH Keywords: scenario
zbMATH Keywords: absolute robust tree
zbMATH Keywords: relative robust tree
zbMATH Keywords: worst case scenario
zbMATH Keywords: neighbourhood of a tree
zbMATH Keywords: local search
zbMATH Keywords: weak tree
MaRDI profile type: Publication
full work available at URL: s12597-021-00538-0
OpenAlex ID: W3189841424
cites work: The robust spanning tree problem with interval data
cites work: On the complexity of the robust spanning tree problem with interval data
cites work: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
cites work: On exact solutions for the minmax regret spanning tree problem
cites work: A branch and bound algorithm for the robust spanning tree problem with interval data
cites work: A Benders decomposition approach for the robust spanning tree problem with interval data
DOI: 10.1007/S12597-021-00538-0
description: scientific article; zbMATH DE number 7603414