Acceleration of cutting-plane and column generation algorithms: Applications to network design

Authors


Abstract

Most of integer, convex, and large-scale linear problems are solved using cutting plane and column generation algorithms. Therefore, to handle large-size problems and to reduce the computing times, it may be very useful to accelerate cutting plane algorithms. We show in this article that we can achieve this goal by choosing good separation points. Focus is given on problems for which we have an exact separation oracle. An in–out algorithm is proposed, and the convergence is proved under some general assumptions. Computational experiments related to three classes of problems, survivable network design, multicommodity flow problems, and random linear programs, clearly point out the savings of time allowed by the simple in–out approach proposed in this article. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 3–17 2007

Ancillary