Optimization Methods for the Partner Units Problem
DOI10.1007/978-3-642-21311-3_4zbMATH Open1302.90164OpenAlexW1674351989WikidataQ59259537 ScholiaQ59259537MaRDI QIDQ3003271FDOQ3003271
Georg Gottlob, Gerhard Friedrich, Markus Aschinger, P. Jeavons, Anna Ryabokon, Evgenij Thorstensen, Conrad Drescher
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
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
- An algorithm of solution of a multiproduct problem of optimal partitioning with constraints
- scientific article
- An efficient optimal solution method for the joint replenishment problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Integer programming (90C10)
Cited In (17)
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
- LoCo—A Logic for Configuration Problems
- Combining Heuristics for Configuration Problems Using Answer Set Programming
- Interactive Debugging of Non-ground ASP Programs
- The Design of the Sixth Answer Set Programming Competition
- Tractability frontiers of the partner units configuration problem
- Structural decompositions for problems with global constraints
- Partial Compilation of ASP Programs
- Debugging Non-ground ASP Programs: Technique and Graphical Tools
- The power of propagation: when GAC is enough
- Managing caching strategies for stream reasoning with reinforcement learning
- Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- Design and results of the Fifth Answer Set Programming Competition
- Title not available (Why is that?)
- On the complexity of the partner units decision problem
- Adaptive large-neighbourhood search for optimisation in answer-set programming
Uses Software
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)
