---
title: "Solving Constraint Optimization Problems in Anytime Contexts"
authors:
  - "Samir Loudni"
  - "Patrice Boizumault"
doi: ""
url: "https://ijcai.org/proceedings/2003/37"
pdf: "https://ijcai.org/proceedings/2003/0037.pdf"
venue: "Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence"
year: 2003
pages: "251-255"
track: ""
keywords:
---

# Solving Constraint Optimization Problems in Anytime Contexts

Samir Loudni, Patrice Boizumault

*Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence*, pages 251-255.

## 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.