Exploiting functional constraints in automatic dominance breaking for constraint optimization

DOI10.1613/JAIR.1.14714MaRDI QIDQ6488814zbMATH OpenFDO

Authors J. H. M. Lee, Allen Z. Zhong

Publication date 23 October 2023

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/JAIR.1.14714

zbMATH Keywords

combinatorial optimizationconstraint programmingdominance breaking

Mathematics Subject Classification ID

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

Recommendations

• Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
• Exploiting subproblem dominance in constraint programming
• Principles and Practice of Constraint Programming – CP 2004
• Improvements on objective and constrain functions in domain optimization
• Implicit constraints handling for efficient search of feasible solutions
• Automatically exploiting subproblem equivalence in constraint programming
• Artificial Intelligence: Methodology, Systems, and Applications
• Efficient Algorithms for Functional Constraints
• Certified dominance and symmetry breaking for combinatorial optimisation

Cites work

• scientific article; zbMATH DE number 1903346 (Why is no real title available?)
• A new heuristic and dominance relations for no-wait flowshops with setups
• An Automatic Method of Solving Discrete Programming Problems
• Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
• Automatically exploiting subproblem equivalence in constraint programming
• Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
• Caching Search States in Permutation Problems
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Dominance breaking constraints
• Essence: A constraint language for specifying combinatorial problems
• Handbook of constraint programming.
• Optimal rectangle packing
• Optimal scheduling in film production to minimize talent hold cost
• Philosophy of the MiniZinc challenge
• Principles and Practice of Constraint Programming – CP 2004
• Propagation via lazy clause generation
• Symmetries, almost symmetries, and lazy clause generation
• Term Rewriting and All That
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• The budgeted maximum coverage problem
• The slab design problem in the steel industry

This page was built for publication: Exploiting functional constraints in automatic dominance breaking for constraint optimization

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