A constraint satisfaction approach to the robust spanning tree problem with interval data

Authors:
Ionut Aron;Pascal Van Hentenryck
Affiliations:
Computer Science Dept., Brown University, Providence, RI;Computer Science Dept., Brown University, Providence, RI
Venue:
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Year:
2002

Citing 3
Cited 15

Data networks

Data networks
Maintaining Minimum Spanning Trees in Dynamic Graphs

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The robust spanning tree problem with interval data

Operations Research Letters

An approximation algorithm for interval data minmax regret combinatorial optimization problems

Information Processing Letters
A Branch and Bound algorithm for the minimax regret spanning arborescence

Journal of Global Optimization
The minimum spanning tree problem with fuzzy costs

Fuzzy Optimization and Decision Making
Simulated annealing algorithm for the robust spanning tree problem

Journal of Heuristics
The "Not-Too-Heavy Spanning Tree" Constraint

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Some methods for evaluating the optimality of elements in matroids with ill-known weights

Fuzzy Sets and Systems
An approximation algorithm for interval data minmax regret combinatorial optimization problems

Information Processing Letters
Simpler and incremental consistency checking and arc consistency filtering algorithms for the weighted spanning tree constraint

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Heuristics for the central tree problem

Journal of Heuristics
The minimum spanning tree constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
An axiomatic approach to robustness in search problems with multiple scenarios

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
A possibilistic approach to combinatorial optimization problems on fuzzy-valued matroids

WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

Operations Research Letters
On the complexity of the robust spanning tree problem with interval data

Operations Research Letters
On exact solutions for the Minmax Regret Spanning Tree problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Robust optimization is one of the fundamental approaches to deal with uncertainty in combinatorial optimization. This paper considers the robust spanning tree problem with interval data, which arises in a variety of telecommunication applications. It proposes a constraint satisfaction approach using a combinatorial lower bound, a pruning component that removes infeasible and suboptimal edges, as well as a search strategy exploring the most uncertain edges first. The resulting algorithm is shown to produce very dramatic improvements over the mathematical programming approach of Yaman et al. and to enlarge considerably the class of problems amenable to effective solutions.