scientific article; zbMATH DE number 1114001

zbMath0889.68139MaRDI QIDQ4375767

Leonidas S. Pitsoulis, Panos M. Pardalos, Mauricio G. C. Resende

Publication date: 2 June 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum satisfiability problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information storage and retrieval of data (68P20)

Related Items (12)

A generalized variable neighborhood search for combinatorial optimization problems ⋮ A nonmonotone GRASP ⋮ A GRASP algorithm to solve the unicost set covering problem ⋮ Worst-case study of local search for MAX-\(k\)-SAT. ⋮ Solving the weighted MAX-SAT problem using the dynamic convexized method ⋮ Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP ⋮ Extending time‐to‐target plots to multiple instances ⋮ An efficient solver for weighted Max-SAT ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ Approximate solutions to the turbine balancing problem. ⋮ Variable neighborhood search: Principles and applications ⋮ Solving weighted MAX-SAT via global equilibrium search

Uses Software

• DIMACS

This page was built for publication: