Concentrator Location in Telecommunications NetworksThe author presents polyhedral results and exact solution methods for location problems encountered in telecommunications but which also have applications in other areas like transportation and supply chain management. Audience This volume is suitable for researchers and practitioners in operations research, telecommunications, location theory and integer programming. |
Contents
VI | 3 |
VII | 9 |
VIII | 10 |
IX | 18 |
X | 20 |
XI | 22 |
XII | 25 |
XIII | 26 |
XXX | 156 |
XXXI | 163 |
XXXII | 165 |
XXXIII | 171 |
XXXIV | 173 |
XXXV | 177 |
XXXVI | 179 |
XXXVII | 180 |
Other editions - View all
Common terms and phrases
2-cycle inequality arcs assigned to node backbone network binpacking inequality branch and bound branch and cut Capacitated Concentrator Location capacitated facility location capacity constraints CFLPS clique compute Concentrator Location Problem condition of Theorem conflict graph consider the solution cover inequalities CPLEX cut algorithm defines a facet denote duality gap facet defining inequalities facet if condition facet of Pus facility facility location problem Figure Hub Location Problem ineq.s k-leaf inequality k-triangle inequality k₁ knapsack problems Labbé and Yaman lifting coefficient lower bound LP relaxation meli odd hole inequality odd node optimal polyhedron polytope preprocessing QCL-C quadratic cover routing cost satisfy inequality solve subset timelimit timelimit timelimit timxij traffic variables UCL polytope UFLP Uncapacitated valid inequality vector W-2 inequality Yaman 50 ΕΙ Σ Σ ΣΣ