A computational evaluation of a general branch-and-price framework for capacitated network location problems |
| |
Authors: | Alberto Ceselli Federico Liberatore Giovanni Righini |
| |
Institution: | (1) Dipartimento di Tecnologie dell’Informazione, Università degli Studi di Milano, via Bramante 65, 26013 Crema, Italy |
| |
Abstract: | The purpose of this paper is to illustrate a general framework for network location problems, based on column generation and
branch-and-price. In particular we consider capacitated network location problems with single-source constraints. We consider
several different network location models, by combining cardinality constraints, fixed costs, concentrator restrictions and
regional constraints. Our general branch-and-price-based approach can be seen as a natural counterpart of the branch-and-cut-based
commercial ILP solvers, with the advantage of exploiting the tightness of the lower bound provided by the set partitioning
reformulation of network location problems. Branch-and-price and branch-and-cut are compared through an extensive set of experimental
tests. |
| |
Keywords: | Network location Branch-and-price Branch-and-cut Integer programming |
本文献已被 SpringerLink 等数据库收录! |
|