Generalized resolution search

  • Authors:

  • Marius Posta;Jacques A. Ferland;Philippe Michelon

  • Affiliations:

  • Université de Montréal, Département d'Informatique et de Recherche Opérationelle, C.P. 6128, Succursale Centre-Ville, Montreal, Quebec, H3C 3J7, Canada and Université d'Av ...;Université de Montréal, Département d'Informatique et de Recherche Opérationelle, C.P. 6128, Succursale Centre-Ville, Montreal, Quebec, H3C 3J7, Canada;Université d'Avignon et des Pays du Vaucluse, Laboratoire d'Informatique d'Avignon, F-84911 Avignon, Cedex 9, France

  • Venue:
  • Discrete Optimization
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Difficult discrete optimization problems are often solved using a Branch-and-Bound approach. Resolution Search is an alternate approach proposed by Chvatal for 0-1 problems, allowing more flexibility in the search process. In this paper, we generalize the Resolution Search approach to any discrete problem.