The following pages link to (Q4375767):
Displaying 12 items.
- A nonmonotone GRASP (Q340011) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP (Q1962023) (← links)
- Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
- A generalized variable neighborhood search for combinatorial optimization problems (Q2631228) (← links)
- Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
- Approximate solutions to the turbine balancing problem. (Q5932031) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
