Capacitated facility location: valid inequalities and facets
Mathematics of Operations Research
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Cooperative Parallel Tabu Search for Capacitated Network Design
Journal of Heuristics
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Simplex-Based Tabu Search Method for Capacitated Network Design
INFORMS Journal on Computing
Benders, metric and cutset inequalities for multicommodity capacitated network design
Computational Optimization and Applications
Solving the Capacitated Local Access Network Design Problem
INFORMS Journal on Computing
A capacity scaling heuristic for the multicommodity capacitated network design problem
Journal of Computational and Applied Mathematics
A local branching heuristic for the capacitated fixed-charge network design problem
Computers and Operations Research
A hybrid VNS for connected facility location
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
INFORMS Journal on Computing
Separation algorithms for 0-1 knapsack polytopes
Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
MIP models for connected facility location: A theoretical and computational study
Computers and Operations Research
Dual-Based Local Search for the Connected Facility Location and Related Problems
INFORMS Journal on Computing
Branch-and-Cut-and-Price for Capacitated Connected Facility Location
Journal of Mathematical Modelling and Algorithms
MIP modeling of incremental connected facility location
INOC'11 Proceedings of the 5th international conference on Network optimization
Relax-and-cut for capacitated network design
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Hi-index | 0.00 |
We consider a network design problem that arises in the cost-optimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem. We refer to it as the Capacitated Connected Facility Location Problem. We develop a basic integer programming model based on single-commodity flows. Based on valid inequalities for the capacitated network design problem and the single-source capacitated facility location problem we derive several (new) classes of valid inequalities for the Capacitated Connected Facility Location Problem including cut set inequalities, cover inequalities and combinations thereof. We use them in a branch-and-cut framework and show their applicability and efficacy on a set of real-world instances.