Optimization Methods for the Partner Units Problem

DOI10.1007/978-3-642-21311-3_4MaRDI QIDQ3003271zbMATH OpenOpenAlexWikidataFDO

Authors Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Anna Ryabokon, Evgenij Thorstensen, P. 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

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

Recommendations

• Tractability frontiers of the partner units configuration problem
• On the complexity of the partner units decision problem
• A multivariate partition approach to optimization problems
• Partnership-enhancement and stability in matching problems
• scientific article; zbMATH DE number 3986997
• scientific article; zbMATH DE number 1538871
• scientific article; zbMATH DE number 4060988
• An algorithm of solution of a multiproduct problem of optimal partitioning with constraints
• scientific article; zbMATH DE number 4110468
• An efficient optimal solution method for the joint replenishment problem

Cited in

(17)

• Tractability frontiers of the partner units configuration problem
• scientific article; zbMATH DE number 7453100 (Why is no real title available?)
• Structural decompositions for problems with global constraints
• Debugging non-ground ASP programs: technique and graphical tools
• Managing caching strategies for stream reasoning with reinforcement learning
• Partial compilation of ASP programs
• LoCo—A Logic for Configuration Problems
• Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
• The Design of the Sixth Answer Set Programming Competition
• Design and results of the Fifth Answer Set Programming Competition
• The power of propagation: when GAC is enough
• Combining Heuristics for Configuration Problems Using Answer Set Programming
• Interactive debugging of non-ground ASP programs
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
• On the complexity of the partner units decision problem
• Adaptive large-neighbourhood search for optimisation in answer-set programming

Describes a project that uses

Uses Software

• BerkMin

This page was built for publication: Optimization Methods for the Partner Units Problem

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