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

DOI10.1016/J.ARTINT.2016.08.006MaRDI QIDQ334808zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

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

Describes a project that uses

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)