On the complexity of the robust spanning tree problem with interval data
type: Item
instance of: scholarly article
title: On the complexity of the robust spanning tree problem with interval data
zbMATH Open document ID: 1056.90114
DOI: 10.1016/S0167-6377(03)00058-0
author: Ionuţ D. Aron
author: Pascal Van Hentenryck
published in: Operations Research Letters
publication date: 2004-07-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2077343
zbMATH Keywords: Robust spanning tree
zbMATH Keywords: Robust optimization
zbMATH Keywords: Uncertainty
zbMATH Keywords: Interval data
MaRDI profile type: Publication
cites work: On trees of a graph and their generation
cites work: Robust discrete optimization and its applications
cites work: Q4851642
cites work: Q3914902
cites work: Q4004084
cites work: The robust spanning tree problem with interval data
description: scientific article; zbMATH DE number 2077343