{"type":"ScholarlyArticle","title":"Solving Constraint Optimization Problems in Anytime Contexts","authors":[{"name":"Samir Loudni","slug":"samir-loudni","given":"Samir","family":"Loudni","affiliation":""},{"name":"Patrice Boizumault","slug":"patrice-boizumault","given":"Patrice","family":"Boizumault","affiliation":""}],"abstract":"This paper presents a new hybrid method for solving constraint optimization problems in anytime contexts. Discrete optimization problems are modelled as Valu ed 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.","doi":null,"url":"https://ijcai.org/proceedings/2003/37","pdf":"https://ijcai.org/proceedings/2003/0037.pdf","markdown":"https://ijcai.org/proceedings/2003/37.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/37","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":37,"pages":{"first":251,"last":255},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}