Optimization Methods for the Partner Units Problem

DOI10.1007/978-3-642-21311-3_4zbMath1302.90164OpenAlexW1674351989WikidataQ59259537 ScholiaQ59259537MaRDI QIDQ3003271

Georg Gottlob, Gerhard Friedrich, Markus Aschinger, Anna Ryabokon, Evgenij Thorstensen, Conrad Drescher, Peter G. Jeavons

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_4

Mathematics Subject Classification ID

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

Related Items

Tractability frontiers of the partner units configuration problem, Structural decompositions for problems with global constraints, Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems, Interactive Debugging of Non-ground ASP Programs, Combining Heuristics for Configuration Problems Using Answer Set Programming, The Design of the Sixth Answer Set Programming Competition, On the complexity of the partner units decision problem, LoCo—A Logic for Configuration Problems, Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper), Partial Compilation of ASP Programs, Design and results of the Fifth Answer Set Programming Competition, The power of propagation: when GAC is enough, Unnamed Item, Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More, Managing caching strategies for stream reasoning with reinforcement learning, Debugging Non-ground ASP Programs: Technique and Graphical Tools

Uses Software

• BerkMin