Skip to Main content Skip to Navigation
New interface

« Resolution Search » et problèmes d’optimisation discrète

Abstract : The combinatorial nature of discrete optimization problems often makes them difficultto solve. Consider for instance integer linear programming problems, which arecommonly solved using a Branch-and-Bound approach. An alternative approach,Resolution Search, was proposed by Chvátal in 1997 for solving 0-1 optimizationproblems, but remains little known to this day and as such has seen few practicalapplications.This thesis attempts to remedy this state of affairs, with partial success. Itsfirst contribution consists in the generalization of Resolution Search to any discreteoptimization problem, while introducing new definitions and concepts. Next, wetried to validate this approach by attempting to solve well-known problems efficientlywith it. Although our research did not succeed in this respect, it lead usto new methods for solving the generalized assignment and uncapacitated facilitylocation problems. After presenting these methods, this thesis concludes with asummary of our attempts at practical application of Resolution Search, along withfurther perspectives on this matter.
Document type :
Complete list of metadata

Cited literature [49 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Monday, March 31, 2014 - 3:44:29 PM
Last modification on : Tuesday, January 14, 2020 - 10:38:05 AM
Long-term archiving on: : Monday, April 10, 2017 - 7:29:20 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00968201, version 1



Marius Posta. « Resolution Search » et problèmes d’optimisation discrète. Autre [cs.OH]. Université d'Avignon, 2012. Français. ⟨NNT : 2012AVIG0189⟩. ⟨tel-00968201⟩



Record views


Files downloads