Optimization methods for the partner units problem

Authors:
Markus Aschinger;Conrad Drescher;Gerhard Friedrich;Georg Gottlob;Peter Jeavons;Anna Ryabokon;Evgenij Thorstensen
Affiliations:
Computing Laboratory, University of Oxford;Computing Laboratory, University of Oxford;Institut für Angewandte Informatik, Alpen-Adria-Universität Klagenfurt;Computing Laboratory, University of Oxford;Computing Laboratory, University of Oxford;Institut für Angewandte Informatik, Alpen-Adria-Universität Klagenfurt;Computing Laboratory, University of Oxford
Venue:
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Year:
2011

Citing 7
Cited 1

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Extending and implementing the stable model semantics

Artificial Intelligence
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Integrated Methods for Optimization (International Series in Operations Research & Management Science)

Integrated Methods for Optimization (International Series in Operations Research & Management Science)
Local restarts

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing

Tackling the partner units configuration problem

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in industry. Unfortunately, it can be shown that in the most general case an optimization version of the problem is intractable. We present and evaluate encodings of the problem in the frameworks of answer set programming, propositional satisfiability testing, constraint solving, and integer programming. We also show how to adapt these encodings to a class of problem instances that we have recently shown to be tractable.