Branch‐and‐Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed‐Charge Network Flow Problem

Branch‐and‐Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed‐Charge Network Flow Problem

0.00 Avg rating0 Votes
Article ID: iaor20132453
Volume: 25
Issue: 2
Start Page Number: 302
End Page Number: 316
Publication Date: Mar 2013
Journal: INFORMS Journal on Computing
Authors: , ,
Keywords: networks: flow
Abstract:

We develop an exact algorithm for integer programs that uses restrictions of the problem to produce high‐quality solutions quickly. Column generation is used both for generating these problem restrictions and for producing bounds on the value of the optimal solution. The performance of the algorithm is greatly enhanced by using structure, such as arises in network flow type applications, to help define the restrictions that are solved. In addition, local search around the current best solution is incorporated to enhance overall performance. The approach is parallelized and computational experiments on a classical problem in network design demonstrate its efficacy.

Reviews

Required fields are marked *. Your email address will not be published.