Branch-and-cut-and-price for capacitated connected facility location

DOI10.1007/s10852-011-9153-5zbMath1235.90093OpenAlexW2061566537WikidataQ57705371 ScholiaQ57705371MaRDI QIDQ662139

Günther R. Raidl, Markus Leitner

Publication date: 21 February 2012

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-011-9153-5

zbMATH Keywords

mixed integer programmingnetwork designbranch-and-cutbranch-and-cut-and-priceconnected facility location

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (13)

The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ Optimizing splitter and fiber location in a multilevel optical FTTH network ⋮ The connected facility location polytope ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ An algorithmic framework for the exact solution of tree-star problems ⋮ A MIP-based approach to solve the prize-collecting local access network design problem ⋮ MIP models for connected facility location: a theoretical and computational study ⋮ Towards optimizing the deployment of optical access networks ⋮ Lagrangian decompositions for the two-level FTTx network design problem ⋮ The incremental connected facility location problem

Uses Software

• SCIP
• CPLEX
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• MIP models for connected facility location: a theoretical and computational study
• Approximation algorithms for connected facility location problems
• On implementing the push-relabel method for the maximum flow problem
• The General Steiner Tree-Star problem.
• Primal-dual algorithms for connected facility location problems
• Conflict analysis in mixed integer programming
• Solving the simple plant location problem by genetic algorithm
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Dual-Based Local Search for the Connected Facility Location and Related Problems
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Steiner problem in networks: A survey
• Solving Multiple Knapsack Problems by Cutting Planes
• Provisioning a virtual private network
• Column Generation
• A Branch and Cut Algorithm for a Steiner Tree-Star Problem
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

This page was built for publication: Branch-and-cut-and-price for capacitated connected facility location