Tractability frontiers of the partner units configuration problem

DOI10.1016/J.JCSS.2015.12.004zbMATH Open1338.68045DBLPjournals/jcss/TeppanFG16OpenAlexW2310736451WikidataQ59259463 ScholiaQ59259463MaRDI QIDQ269477FDOQ269477

Authors: Erich Christian Teppan, Gerhard Friedrich, Georg Gottlob 

Publication date: 18 April 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2015.12.004

Recommendations

• On the complexity of the partner units decision problem
• Optimization Methods for the Partner Units Problem
• On the complexity of the unit commitment problem
• On the complexity of some partition problems
• scientific article; zbMATH DE number 5999532

zbMATH Keywords

computational complexityNP-completenesspartner units problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)

Cites Work

• The DLV system for knowledge representation and reasoning
• Optimization Methods for the Partner Units Problem
• Title not available (Why is that?)

Cited In (3)

• Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
• Optimization Methods for the Partner Units Problem
• On the complexity of the partner units decision problem

This page was built for publication: Tractability frontiers of the partner units configuration problem

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