Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
A constraint satisfaction approach to the robust spanning tree problem with interval data
Ionut Aron, Pascal Van Hentenryck
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
Keywords:
Pages: 18-25
PS Link:
PDF Link: /papers/02/p18-aron.pdf
BibTex:
@INPROCEEDINGS{Aron02,
AUTHOR = "Ionut Aron and Pascal Van Hentenryck",
TITLE = "A constraint satisfaction approach to the robust spanning tree problem with interval data",
BOOKTITLE = "Proceedings of the Eighteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-02)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "2002",
PAGES = "18--25"
}


hosted by DSL   •   site info   •   help