Pages that link to "Item:Q1850970"
From MaRDI portal
The following pages link to Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation (Q1850970):
Displayed 9 items.
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Continuous functions minimization by dynamic random search technique (Q2470277) (← links)
- Improving genetic algorithms' performance by local search for continuous function optimization (Q2474888) (← links)
- A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- SAT-Based Formula Simplification (Q3453233) (← links)