| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141504 | Discrete Optimization | 2011 | 14 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Marius Posta, Jacques A. Ferland, Philippe Michelon,