A Heuristic for Boolean Optimization Problems

  • Authors:
  • Thomas Davoine;Peter L. Hammer;Béla Vizvári

  • Affiliations:
  • RUTCOR, Rutgers University, New Brunswick, NJ, USA;RUTCOR, Rutgers University, New Brunswick, NJ, USA;Dept. of OR, Eötvös Loránd University of Budapest

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A heuristic method is proposed for the solution of a large class of binary optimization problems, which includes weighted versions of the set covering, graph stability, partitioning, maximum satisfiability, and numerous other problems. The reported substantial computational experiments amply demonstrate the efficiency of the proposed method.