Three generalizations of the FOCUS constraint

DOI10.1007/S10601-015-9233-7MaRDI QIDQ2398512zbMATH OpenOpenAlexFDO

Authors Nina Narodytska, Thierry Petit, Mohamed Siala, Toby Walsh

Publication date 16 August 2017

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.5970, https://zenodo.org/record/3911464

zbMATH Keywords

global constraintsconstraint propagation

Mathematics Subject Classification ID

Integer programming (90C10)

Abstract: The FOCUS constraint expresses the notion that solutions are concentrated. In practice, this constraint suffers from the rigidity of its semantics. To tackle this issue, we propose three generalizations of the FOCUS constraint. We provide for each one a complete filtering algorithm as well as discussing decompositions.

Recommendations

• scientific article; zbMATH DE number 2159467
• Global Constraints: A Survey
• Generalizing Global Constraints Based on Network Flows
• scientific article; zbMATH DE number 1234562
• The objective sum constraint

Cites work

• scientific article; zbMATH DE number 2084705 (Why is no real title available?)
• A \texttt{cost-regular} based hybrid column generation approach
• Handbook of constraint programming.
• Minimization of the number of breaks in sports scheduling problems using constraint programming
• Network flows. Theory, algorithms, and applications.
• Optimal Capacity Scheduling—I
• Principles and Practice of Constraint Programming – CP 2004
• SPREAD: A Balancing Constraint Based on Statistics
• The Deviation Constraint

Cited in

(2)

• Principles and Practice of Constraint Programming – CP 2004
• Enriching Solutions to Combinatorial Problems via Solution Engineering

This page was built for publication: Three generalizations of the FOCUS constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398512)