Constraints

, Volume 21, Issue 4, pp 533–556

Theoretical insights and algorithmic tools for decision diagram-based optimization

Article

DOI: 10.1007/s10601-016-9239-9

Cite this article as:
Bergman, D. & Cire, A.A. Constraints (2016) 21: 533. doi:10.1007/s10601-016-9239-9
  • 200 Downloads

Abstract

The use of decision diagrams has recently emerged as a viable general solution approach for solving discrete optimization problems. The decision diagram data structure is used to explicitly represent, either exactly or approximately, the set of feasible solutions to a given problem. Techniques based on decision diagrams have been successfully used on a diverse set of applications, ranging from scheduling to combinatorial optimization, and have often outperformed commercial state-of-the-art constraint programming and integer programming technology. Lacking, however, is a thorough theoretical investigation into the quality of approximate decision diagrams, as well as the development of structured techniques for tightening relaxation bounds provided by approximate decision diagrams, analogously to how cutting-planes are used in integer programming. This paper provides an analysis of the strength of approximate decision diagrams, as well as the description of several bound-tightening procedures for problems with linear objective functions.

Keywords

Decision diagrams Discrete optimization Constraint satisfaction problems Constraint optimization problems 

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.School of BusinessUniversity of ConnecticutStamfordUSA
  2. 2.Department of ManagementUniversity of Toronto ScarboroughTorontoCanada

Personalised recommendations