Some tractable instances of interval data minmax regret problems
type: Item
instance of: scholarly article
title: Some tractable instances of interval data minmax regret problems
zbMATH Open document ID: 1155.90467
author: Bruno Escoffier
author: Jérôme Monnot
author: Olivier Spanjaard
published in: Operations Research Letters
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5522981
zbMATH Keywords: robust optimization
zbMATH Keywords: interval data
zbMATH Keywords: shortest path
zbMATH Keywords: spanning tree
zbMATH Keywords: bipartite perfect matching
MaRDI profile type: Publication
full work available at URL: j.orl.2007.12.004
OpenAlex ID: W2046158724
cites work: On the complexity of the robust spanning tree problem with interval data
cites work: On digraph coloring problems and treewidth duality
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Interval data minmax regret network optimization problems
cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs
cites work: Contribution to nonserial dynamic programming
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Q4393480
cites work: Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: Parameterized and Exact Computation
cites work: The robust spanning tree problem with interval data
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: The robust shortest path problem in series -- parallel multidigraphs with interval data
cites work: Robust discrete optimization and its applications
cites work: Non deterministic polynomial optimization problems and their approximations
DOI: 10.1016/J.ORL.2007.12.004
description: scientific article; zbMATH DE number 5522981