MIP models for connected facility location: a theoretical and computational study
From MaRDI portal
Publication:709181
DOI10.1016/j.cor.2010.07.002zbMath1231.90267OpenAlexW2071330374WikidataQ41518692 ScholiaQ41518692MaRDI QIDQ709181
Stefan Gollowitzer, Ivana Ljubić
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.002
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (25)
Upgrading nodes in tree-shaped hub location ⋮ The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ Approximate robust optimization for the connected facility location problem ⋮ Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ A two-level off-grid electric distribution problem on the continuous space ⋮ Benders decomposition of the passive optical network design problem ⋮ 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 ⋮ General network design: a unified view of combined location and network design problems ⋮ Optimizing splitter and fiber location in a multilevel optical FTTH network ⋮ The connected facility location polytope ⋮ Branch‐and‐cut algorithms for the ‐arborescence star problem ⋮ Heuristic and exact algorithms for minimum-weight non-spanning arborescences ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ Branch-and-cut-and-price for capacitated connected facility location ⋮ Fiber cable network design in tree networks ⋮ An algorithmic framework for the exact solution of tree-star problems ⋮ Outer approximation and submodular cuts for maximum capture facility location problems with random utilities ⋮ A MIP-based approach to solve the prize-collecting local access network design problem ⋮ Towards optimizing the deployment of optical access networks ⋮ A branch-and-cut algorithm for the maximum covering cycle problem ⋮ Lagrangian decompositions for the two-level FTTx network design problem ⋮ A tailored Benders decomposition approach for last-mile delivery with autonomous robots ⋮ The incremental connected facility location problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-cut-and-price for capacitated connected facility location
- Tight bounds from a path based formulation for the tree of hub location problem
- Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
- A comparative analysis of several asymmetric traveling salesman problem formulations
- The tree of hubs location problem
- On the exact solution of large-scale simple plant location problems
- An analytical comparison of different formulations of the travelling salesman problem
- The Steiner tree polytope and related polyhedra
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- On implementing the push-relabel method for the maximum flow problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- Strong lower bounds for the prize collecting Steiner problem in graphs
- The General Steiner Tree-Star problem.
- Primal-dual algorithms for connected facility location problems
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Solving the simple plant location problem by genetic algorithm
- Dual-Based Local Search for the Connected Facility Location and Related Problems
- The regenerator location problem
- Integer Programming Formulation of Traveling Salesman Problems
- Solving Steiner tree problems in graphs to optimality
- Provisioning a virtual private network
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- A catalog of steiner tree formulations
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- A Branch and Cut Algorithm for a Steiner Tree-Star Problem
- A faster approximation algorithm for the Steiner problem in graphs
- A comparison of Steiner tree relaxations
This page was built for publication: MIP models for connected facility location: a theoretical and computational study
