Pages that link to "Item:Q1351586"
From MaRDI portal
The following pages link to New local search approximation techniques for maximum generalized satisfiability problems (Q1351586):
Displaying 14 items.
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- New local search approximation techniques for maximum generalized satisfiability problems (Q1351586) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
- Guided local search for solving SAT and weighted MAX-SAT problems (Q1977758) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- Guided local search for solving SAT and weighted MAX-SAT problems (Q2749855) (← links)
- Nonoblivious 2-opt heuristics for the traveling salesman problem (Q2811309) (← links)
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (Q4930591) (← links)
- (Q5091725) (← links)
- Building a small and informative phylogenetic supertree (Q6077843) (← links)
