The inequality-satisfiability problem

DOI10.1016/J.ORL.2007.05.005zbMATH Open1153.68392OpenAlexW2025994298MaRDI QIDQ935232FDOQ935232

Authors: 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

Recommendations

• A simplified NP-complete satisfiability problem
• The Inverse Satisfiability Problem
• The complexity of satisfiability problems
• scientific article; zbMATH DE number 496040
• A simplified NP-complete MAXSAT problem

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

• Title not available (Why is that?)
• On the Complexity of Timetable and Multicommodity Flow Problems
• On the complexity of computing the measure of ∪[a _i ,b _i ]
• Mould design with sweep operations --- a heuristic search approach

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

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