ML Anthology

Solving Constraint Optimization Problems in Anytime Contexts

Samir Loudni, Patrice Boizumault
IJCAI 2003 pp. 251-256
/ijcai/2003/loudni2003ijcai-solving/

Abstract

This paper presents a new hybrid method for solving constraint optimization problems in anytime contexts. Discrete optimization problems are modelled as Valued CSP. Our method (VNS/LDS+CP) combines a Variable Neighborhood Search and Limited Discrepancy Search with Constraint Propagation to efficiently guide the search. Experiments on the CELAR benchmarks demonstrate significant improvements over other competing methods. VNS/LDS+CP has been successfully applied to solve a real-life anytime resource allocation problem in computer networks.

PDF Semantic Scholar

Cite

Text

Loudni and Boizumault. "Solving Constraint Optimization Problems in Anytime Contexts." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[Loudni and Boizumault. "Solving Constraint Optimization Problems in Anytime Contexts." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/loudni2003ijcai-solving/)

BibTeX

@inproceedings{loudni2003ijcai-solving,
  title     = {{Solving Constraint Optimization Problems in Anytime Contexts}},
  author    = {Loudni, Samir and Boizumault, Patrice},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {251-256},
  url       = {https://mlanthology.org/ijcai/2003/loudni2003ijcai-solving/}
}