Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
From MaRDI portal
Publication:1962023
Cites work
- scientific article; zbMATH DE number 1002206 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 1306875 (Why is no real title available?)
- scientific article; zbMATH DE number 1114001 (Why is no real title available?)
- A More Portable Fortran Random Number Generator
- Approximation algorithms for combinatorial problems
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- Greedy randomized adaptive search procedures
- How easy is local search?
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- The complexity of optimization problems
Cited in
(7)- The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
- An efficient solver for weighted Max-SAT
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Extending time-to-target plots to multiple instances
- Incomplete inference for graph problems
- A nonmonotone GRASP
- Solving the weighted MAX-SAT problem using the dynamic convexized method
This page was built for publication: Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962023)
