Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
From MaRDI portal
Publication:1962023
DOI10.1016/S0166-218X(99)00171-7zbMATH Open0941.68527WikidataQ127565009 ScholiaQ127565009MaRDI QIDQ1962023FDOQ1962023
Authors: Mauricio G. C. Resende, Leonidas Pitsoulis, Panos M. Pardalos 
Publication date: 13 July 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for combinatorial problems
- The complexity of optimization problems
- How easy is local search?
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Greedy randomized adaptive search procedures
- A More Portable Fortran Random Number Generator
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Title not available (Why is that?)
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- Title not available (Why is that?)
Cited In (7)
- Extending time‐to‐target plots to multiple instances
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
- A nonmonotone GRASP
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- An efficient solver for weighted Max-SAT
- Incomplete inference for graph problems
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)
