scientific article; zbMATH DE number 1114001
From MaRDI portal
Publication:4375767
Recommendations
Cited in
(18)- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- A generalized variable neighborhood search for combinatorial optimization problems
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- A cooperative search method for the weighted Max-Sat problems
- A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
- Worst-case study of local search for MAX-\(k\)-SAT.
- GRASP with path relinking for the weighted MAXSAT problem
- Experimental and Efficient Algorithms
- Variable neighborhood search: Principles and applications
- A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem
- Extending time-to-target plots to multiple instances
- A GRASP algorithm to solve the unicost set covering problem
- A nonmonotone GRASP
- Solving weighted MAX-SAT via global equilibrium search
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- An efficient solver for weighted Max-SAT
- scientific article; zbMATH DE number 2043435 (Why is no real title available?)
- Approximate solutions to the turbine balancing problem.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375767)
