scientific article; zbMATH DE number 1114001
From MaRDI portal
Publication:4375767
zbMATH Open0889.68139MaRDI QIDQ4375767FDOQ4375767
Authors: Leonidas Pitsoulis, Mauricio G. C. Resende, Panos M. Pardalos 
Publication date: 2 June 1998
Title of this publication is not available (Why is that?)
Recommendations
Information storage and retrieval of data (68P20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05)
Cited In (18)
- A generalized variable neighborhood search for combinatorial optimization problems
- A cooperative search method for the weighted Max-Sat problems
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- 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.
- Experimental and Efficient Algorithms
- Variable neighborhood search: Principles and applications
- GRASP with path relinking for the weighted MAXSAT problem
- 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
- Title not available (Why is that?)
- Approximate solutions to the turbine balancing problem.
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
Uses Software
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)
