The objective sum constraint

DOI10.1007/978-3-642-21311-3_18zbMATH Open1326.68270OpenAlexW1535934642MaRDI QIDQ3003287FDOQ3003287

Jean-Charles Régin, Thierry Petit

Publication date: 26 May 2011

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21311-3_18

Recommendations

• Inequality-sum: a global constraint capturing the objective function
• scientific article; zbMATH DE number 2080320
• The complexity of reasoning with global constraints
• Objective landscapes for constraint programming
• Principles and Practice of Constraint Programming – CP 2003

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (3)

• Title not available (Why is that?)
• A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property
• Inequality-sum: a global constraint capturing the objective function

This page was built for publication: The objective sum constraint

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