Differential approximation for optimal satisfiability and related problems
From MaRDI portal
Publication:1869721
DOI10.1016/S0377-2217(02)00299-0zbMath1031.90025MaRDI QIDQ1869721
Cristina Bazgan, Vangelis Th. Paschos
Publication date: 28 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
Differential approximation of MIN SAT, MAX SAT and related problems ⋮ A survey on the structure of approximation classes ⋮ A better differential approximation ratio for symmetric TSP ⋮ COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES ⋮ New differential approximation algorithm for \(k\)-customer vehicle routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational experience with an interior point algorithm on the satisfiability problem
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Structure preserving reductions among convex optimization problems
- Optimization, approximation, and complexity classes
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Proof verification and the hardness of approximation problems
This page was built for publication: Differential approximation for optimal satisfiability and related problems
