Constraint programming is a declarative method for modelling and solving decision problems by specifying variables, their domains and relations that must hold. Combinatorial optimization extends this ...

Combinatorial optimisation for constraint problems encompasses a broad class of decision and optimisation tasks in which discrete choices must satisfy intricate side conditions. Typical examples ...

Tsukuba, Japan—Distributed constraint optimization problems are crucial for modeling cooperative-multiagent systems. Asynchronous Distributed OPTimization (ADOPT) is a well-known algorithm for solving ...