Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
type: Item
instance of: scholarly article
title: Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
zbMATH Open document ID: 0941.68527
DOI: 10.1016/S0166-218X(99)00171-7
author: Mauricio G. C. Resende
author: Leonidas Pitsoulis
author: Panos M. Pardalos
published in: Discrete Applied Mathematics
publication date: 2000-07-13T00:00:00Z
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 1394993
zbMATH Keywords: Fortran subroutines
MaRDI profile type: Publication
cites work: Q4230322
cites work: Q3129924
cites work: Q4252727
cites work: Greedy randomized adaptive search procedures
cites work: Q4198056
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Approximation algorithms for combinatorial problems
cites work: How easy is local search?
cites work: The complexity of optimization problems
cites work: Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
cites work: Q4375767
cites work: A More Portable Fortran Random Number Generator
Wikidata QID: Q127565009
description: scientific article; zbMATH DE number 1394993