0–1 reformulations of the multicommodity capacitated network design problem
نویسندگان
چکیده
منابع مشابه
0-1 Reformulations of the Multicommodity Capacitated Network Design Problem
We study 0–1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a generic approach to represent piecewise linear costs using 0–1 variables. This model is improved ...
متن کاملMulticommodity Capacitated Network Design Problem
We study 0-1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent, design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a generic approach to represent piecewise linear costs using 0-1 variables. This model is improved...
متن کاملMulticommodity Capacitated Network Design
This paper presents a comprehensive survey of models and algorithms for multicommodity capacitated network design problems, which are mostly encountered in telecommunications and transportation network planning. These problems are important not only due to the major relevance of their applications, but also because they pose considerable modeling and algorithmic challenges. We present a general...
متن کاملScale Multicommodity Capacitated Fixed-Charge Network Design
We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem. The restricted master problem solved at each column generation iteration is obtained directly from the compact arc-based model by considering only a subset of the commodity flow variables. The pricing subproblem corresponds to a Lagrangian rela...
متن کاملFormulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
This paper addresses the multicommodity capacitated fixed-charge network design problem with nonbifurcated flows and hop constraints. We present and compare mathematical programming formulations for this problem and we study different relaxations: linear programming relaxations, Lagrangean relaxations and partial relaxations of the integrality constraints. In particular, for the hop-indexed for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.04.022