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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01320028
Contributor : Bibliothèque Universitaire Déposants Hal-Avignon <>
Submitted on : Monday, May 23, 2016 - 1:43:09 PM
Last modification on : Wednesday, April 17, 2019 - 12:15:35 PM

Links full text

Identifiers

Collections

Citation

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

Share

Metrics

Record views

61