The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We summarize the main results of the authors PhD thesis, defended in February 2003 at the Katholieke Universiteit Leuven (Belgium) and supervised by Dirk Cattrysse. The thesis is written in English and presents a number of solution and modeling approaches for distribution problems in the context of arc routing. In particular, the focus is on (1) local search procedures for arc routing problems, (2)...
. We survey the main results of the author’s PhD thesis that was supervised by Claude Le Pape (ILOG, France) and Philippe Michelon (Université d’Avignon, France) and has been defended in June 2004. The dissertation is written in French and is available from the author. It introduces several strategies for integrating local search techniques into mixed integer programming, with an emphasis on generic...
The design of effective neighborhood structures is fundamental to the performance of local search and metaheuristic algorithms for combinatorial optimization. Significant efforts have been made in the creation of larger and more powerful neighborhoods that are able to explore the solution space more extensively and effectively while keeping computation complexity within acceptable levels. The most...
The Minimum Formwork Stock problem (MFS) consists in minimizing the quantity of shuttering materials needed for a construction site. This paper introduces this problem encountered in a French building company and presents two different solving approaches: a constraint programming model combined with a constructive heuristic and a Dantzig–Wolfe decomposition taking advantage of the size of real world...
This paper introduces LocalSolver 1.x, a black-box local-search solver for general 0-1 programming. This software allows OR practitioners to focus on the modeling of the problem using a simple formalism, and then to defer its actual resolution to a solver based on efficient and reliable local-search techniques. Started in 2007, the goal of the LocalSolver project is to offer a model-and-run approach...
This is a summary of the author’s PhD thesis supervised by Andrea Lodi and Paolo Toth and defended on 16 April 2009 at the Università di Bologna. The thesis is written in English and is available from the author upon request. This work is focused on Mixed Integer Programming (MIP). In particular, the first part of the thesis deals with general purpose cutting planes, which are probably the key ingredient...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.