MIP models for connected facility location: a theoretical and computational study
From MaRDI portal
Publication:709181
DOI10.1016/J.COR.2010.07.002zbMATH Open1231.90267OpenAlexW2071330374WikidataQ41518692 ScholiaQ41518692MaRDI QIDQ709181FDOQ709181
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
Recommendations
- Branch-and-cut-and-price for capacitated connected facility location
- MIP modeling of incremental connected facility location
- Dual-based local search for the connected facility location and related problems
- The incremental connected facility location problem
- Primal-dual algorithms for connected facility location problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Mixed integer programming (90C11) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Solving Steiner tree problems in graphs to optimality
- An analytical comparison of different formulations of the travelling salesman problem
- Integer Programming Formulation of Traveling Salesman Problems
- 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
- Neighborhood search heuristics for the uncapacitated facility location problem
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Solving the simple plant location problem by genetic algorithm
- The regenerator location problem
- Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
- 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
- Tight bounds from a path based formulation for the tree of hub location 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
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Dual-based local search for the connected facility location and related problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Provisioning a virtual private network
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- A Branch and Cut Algorithm for a Steiner Tree-Star Problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A comparison of Steiner tree relaxations
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- A catalog of steiner tree formulations
- A faster approximation algorithm for the Steiner problem in graphs
- Branch-and-cut-and-price for capacitated connected facility location
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
- The General Steiner Tree-Star problem.
Cited In (27)
- Branch‐and‐cut algorithms for the ‐arborescence star problem
- A MIP-based approach to solve the prize-collecting local access network design problem
- Approximate robust optimization for the connected facility location problem
- Fiber cable network design in tree networks
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Upgrading nodes in tree-shaped hub location
- The connected facility location polytope
- The online multicommodity connected facility location problem
- General network design: a unified view of combined location and network design problems
- A two-level off-grid electric distribution problem on the continuous space
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- A cutting plane algorithm for the capacitated connected facility location problem
- Benders decomposition of the passive optical network design problem
- The incremental connected facility location problem
- Solving Steiner trees: Recent advances, challenges, and perspectives
- A branch-and-cut algorithm for the maximum covering cycle problem
- Lagrangian decompositions for the two-level FTTx network design problem
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
- Branch-and-cut-and-price for capacitated connected facility location
- Configuration‐based approach for topological problems in the design of wireless sensor networks
- Towards optimizing the deployment of optical access networks
- The \(p\)-arborescence star problem: formulations and exact solution approaches
- An algorithmic framework for the exact solution of tree-star problems
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- New formulations for two location problems with interconnected facilities
Uses Software
This page was built for publication: MIP models for connected facility location: a theoretical and computational study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709181)
