Generalized resolution search

Marius Posta (1) , Jacques A. Ferland (1) , Philippe Michelon (2)

1 DIRO - Département d'Informatique et de Recherche Opérationnelle [Montreal]
2 LIA - Laboratoire Informatique d'Avignon

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

Domaines: Informatique [cs]

Marius Posta, Jacques A. Ferland, Philippe Michelon. Generalized resolution search. Discrete Optimization, 2011, ⟨10.1016/j.disopt.2010.08.004⟩. ⟨hal-01320028⟩