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

DOI10.1016/j.artint.2016.08.006zbMath1392.68389OpenAlexW2519574144WikidataQ57574225 ScholiaQ57574225MaRDI QIDQ334808

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

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

propagatorconstraint programmingdiscrete convexity

Mathematics Subject Classification ID

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

Uses Software

• OscaR

Cites Work

• Constraint satisfaction over connected row-convex constraints
• Introducing global constraints in CHIP
• A dynamic programming approach for consistency and propagation for knapsack constraints
• Cost-based arc consistency for global cardinality constraints
• Properties of tree convex constraints
• Submodular functions and optimization.
• 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

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