New local search approximation techniques for maximum generalized satisfiability problems
From MaRDI portal
Publication:1351586
DOI10.1016/0020-0190(95)00196-4zbMath1022.68560OpenAlexW2083642130WikidataQ127372884 ScholiaQ127372884MaRDI QIDQ1351586
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00196-4
computational complexityapproximationlocal searchdesign of algorithmsmaximum generalized satisfiability
Related Items (7)
New local search approximation techniques for maximum generalized satisfiability problems ⋮ Building a small and informative phylogenetic supertree ⋮ Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) ⋮ Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees ⋮ Unnamed Item ⋮ Nonoblivious 2-Opt heuristics for the traveling salesman problem ⋮ Oblivious algorithms for the maximum directed cut problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local search, reducibility and approximability of NP-optimization problems
- Algorithms for the maximum satisfiability problem
- How easy is local search?
- Toward a unified approach for the classification of NP-complete optimization problems
- Non deterministic polynomial optimization problems and their approximations
- Optimization, approximation, and complexity classes
- Approximation algorithms for combinatorial problems
- New local search approximation techniques for maximum generalized satisfiability problems
- On Syntactic versus Computational Views of Approximability
This page was built for publication: New local search approximation techniques for maximum generalized satisfiability problems
