BDD-based heuristics for binary optimization

David Bergman, Andre A. Cire, Willem Jan Van Hoeve, Tallys Yunes

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

In this paper we introduce a new method for generating heuristic solutions to binary optimization problems. We develop a technique based on binary decision diagrams. We use these structures to provide an under-approximation to the set of feasible solutions. We show that the proposed algorithm delivers comparable solutions to a state-of-the-art general-purpose optimization solver on randomly generated set covering and set packing problems.

Original languageEnglish (US)
Pages (from-to)211-234
Number of pages24
JournalJournal of Heuristics
Volume20
Issue number2
DOIs
StatePublished - Jan 1 2014

Fingerprint

Heuristics
Set Packing
Binary
Binary decision diagrams
Set Covering
Decision Diagrams
Optimization
Packing Problem
Optimization Problem
Approximation
Optimization problem
Diagrams

Keywords

  • Binary decision diagrams
  • Heuristics
  • Set covering
  • Set packing

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Networks and Communications
  • Control and Optimization
  • Management Science and Operations Research
  • Artificial Intelligence

Cite this

BDD-based heuristics for binary optimization. / Bergman, David; Cire, Andre A.; Van Hoeve, Willem Jan; Yunes, Tallys.

In: Journal of Heuristics, Vol. 20, No. 2, 01.01.2014, p. 211-234.

Research output: Contribution to journalArticle

Bergman, David ; Cire, Andre A. ; Van Hoeve, Willem Jan ; Yunes, Tallys. / BDD-based heuristics for binary optimization. In: Journal of Heuristics. 2014 ; Vol. 20, No. 2. pp. 211-234.
@article{5184b9a0b80742d4b3275bf6724429b2,
title = "BDD-based heuristics for binary optimization",
abstract = "In this paper we introduce a new method for generating heuristic solutions to binary optimization problems. We develop a technique based on binary decision diagrams. We use these structures to provide an under-approximation to the set of feasible solutions. We show that the proposed algorithm delivers comparable solutions to a state-of-the-art general-purpose optimization solver on randomly generated set covering and set packing problems.",
keywords = "Binary decision diagrams, Heuristics, Set covering, Set packing",
author = "David Bergman and Cire, {Andre A.} and {Van Hoeve}, {Willem Jan} and Tallys Yunes",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/s10732-014-9238-1",
language = "English (US)",
volume = "20",
pages = "211--234",
journal = "Journal of Heuristics",
issn = "1381-1231",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - BDD-based heuristics for binary optimization

AU - Bergman, David

AU - Cire, Andre A.

AU - Van Hoeve, Willem Jan

AU - Yunes, Tallys

PY - 2014/1/1

Y1 - 2014/1/1

N2 - In this paper we introduce a new method for generating heuristic solutions to binary optimization problems. We develop a technique based on binary decision diagrams. We use these structures to provide an under-approximation to the set of feasible solutions. We show that the proposed algorithm delivers comparable solutions to a state-of-the-art general-purpose optimization solver on randomly generated set covering and set packing problems.

AB - In this paper we introduce a new method for generating heuristic solutions to binary optimization problems. We develop a technique based on binary decision diagrams. We use these structures to provide an under-approximation to the set of feasible solutions. We show that the proposed algorithm delivers comparable solutions to a state-of-the-art general-purpose optimization solver on randomly generated set covering and set packing problems.

KW - Binary decision diagrams

KW - Heuristics

KW - Set covering

KW - Set packing

UR - http://www.scopus.com/inward/record.url?scp=84896392277&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896392277&partnerID=8YFLogxK

U2 - 10.1007/s10732-014-9238-1

DO - 10.1007/s10732-014-9238-1

M3 - Article

AN - SCOPUS:84896392277

VL - 20

SP - 211

EP - 234

JO - Journal of Heuristics

JF - Journal of Heuristics

SN - 1381-1231

IS - 2

ER -