Optimum Anytime Bounding for Constraint Optimization Problems Simon de Givry and G rard Verfaillie

AAAI Conferences 

Edouard Belin, BP 4025, 31055 Toulouse Cedex 4, France {degivry,verfaillie}@cert.fr Abstract In this paper, we consider Constraint Optimization Problems in a Resource-Bounded context. We observe that both exact and approximate methods produce only an anytime upper bound of the optimum (in case of minimization). No lower bound, and thus no quality is available at run time. For a meta-reasoning system, it is difficult to reason on the basis of a so poor piece of information. Therefore, we discuss some ways of producing an anytime lower bound.

Duplicate Docs Excel Report

None found

Similar Docs  Excel Report  more

None found