The inequality-satisfiability problem

DOI10.1016/j.orl.2007.05.005zbMath1153.68392OpenAlexW2025994298MaRDI QIDQ935232

Dorit S. Hochbaum, Erick Moreno-Centeno

Publication date: 6 August 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.05.005

zbMATH Keywords

inequality-satisfiabilityor-inequalitiesparting directionssatisfiability (SAT)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Mould design with sweep operations --- a heuristic search approach
• On the Complexity of Timetable and Multicommodity Flow Problems
• On the complexity of computing the measure of ∪[a _i ,b _i ]

This page was built for publication: The inequality-satisfiability problem