2026-07-23T07:58:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2168 2024-03-06T11:08:51Z ddc:004 open_access

Using Branch-and-Price to Find High Quality Solutions Quickly Nemhauser, George Hewitt, Mike Savelsbergh, Martin Column generation branch-and-price mixed-integer programming inventory routing We develop an exact solution approach for integer programs that produces high- quality solutions quickly by solving well-chosen restrictions of the problem. Column generation is used both for generating these problem restrictions and for producing bounds on the value of an optimal solution to the problem. Obtaining primal solutions by solving problem restrictions also provides an easy way to search for improved solutions in the neighborhood of the current best solution. The overall approach is parallelized and computational experiments demonstrate its efficacy. An application to inventory routing is presented. Schloss Dagstuhl – Leibniz-Zentrum für Informatik George Nemhauser and Mike Hewitt and Martin Savelsbergh 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09261.33 urn:nbn:de:0030-drops-21681 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.33 eng https://creativecommons.org/licenses/by/4.0/legalcode