Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
From MaRDI portal
Publication:1962023
DOI10.1016/S0166-218X(99)00171-7zbMath0941.68527WikidataQ127565009 ScholiaQ127565009MaRDI QIDQ1962023
Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos
Publication date: 13 July 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
A nonmonotone GRASP, The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems, Incomplete inference for graph problems, Solving the weighted MAX-SAT problem using the dynamic convexized method, Extending time‐to‐target plots to multiple instances, An efficient solver for weighted Max-SAT, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of optimization problems
- How easy is local search?
- 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
- A More Portable Fortran Random Number Generator
- 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
