Generalized resolution search - Archive ouverte HAL
Journal Articles Discrete Optimization Year : 2011

Generalized resolution search

Abstract

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.

Dates and versions

hal-01320028 , version 1 (23-05-2016)

Identifiers

Cite

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

Collections

UNIV-AVIGNON LIA
31 View
0 Download

Altmetric

Share

More