A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property

DOI10.1016/J.ARTINT.2016.08.006zbMATH Open1392.68389OpenAlexW2519574144WikidataQ57574225 ScholiaQ57574225MaRDI QIDQ334808FDOQ334808

Authors: Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener, Justin Pearson 

Publication date: 1 November 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.08.006

Recommendations

• Generalized support and formal development of constraint propagators
• The objective sum constraint
• The Deviation Constraint
• When is it worthwhile to propagate a constraint? A probabilistic analysis of \textsc{AllDifferent}
• View-based propagator derivation

zbMATH Keywords

constraint programmingpropagatordiscrete convexity

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites Work

• Introducing global constraints in CHIP
• Cost-based arc consistency for global cardinality constraints
• Submodular functions and optimization.
• Constraint satisfaction over connected row-convex constraints
• A dynamic programming approach for consistency and propagation for knapsack constraints
• Properties of tree convex constraints
• Achieving domain consistency and counting solutions for dispersion constraints
• Recent developments in discrete convex analysis
• The objective sum constraint
• SPREAD: A Balancing Constraint Based on Statistics
• Recent Advances in Constraints
• Principles and Practice of Constraint Programming – CP 2004

Uses Software

• OscaR

This page was built for publication: A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property

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