MIP models for connected facility location: a theoretical and computational study

DOI10.1016/J.COR.2010.07.002MaRDI QIDQ709181zbMATH OpenOpenAlexWikidataFDO

Authors Stefan Gollowitzer, Ivana Ljubić

Publication date 15 October 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.cor.2010.07.002

zbMATH Keywords

facility locationSteiner treesLP-relaxationsmixed integer programming models

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 5764866 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• A Branch and Cut Algorithm for a Steiner Tree-Star Problem
• A catalog of steiner tree formulations
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A comparison of Steiner tree relaxations
• A faster approximation algorithm for the Steiner problem in graphs
• 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
• An analytical comparison of different formulations of the travelling salesman problem
• Branch-and-cut-and-price for capacitated connected facility location
• Dual-based local search for the connected facility location and related problems
• Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
• Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• Neighborhood search heuristics for the uncapacitated facility location problem
• Network flows. Theory, algorithms, and applications.
• On implementing the push-relabel method for the maximum flow problem
• On the exact solution of large-scale simple plant location problems
• Primal-dual algorithms for connected facility location problems
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Solving Steiner tree problems in graphs to optimality
• Solving the simple plant location problem by genetic algorithm
• Strong lower bounds for the prize collecting Steiner problem in graphs
• The General Steiner Tree-Star problem.
• The Steiner tree polytope and related polyhedra
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• The regenerator location problem
• The tree of hubs location problem
• Tight bounds from a path based formulation for the tree of hub location problem
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints

Cited in

(30)

• Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
• Dual-based local search for the connected facility location and related problems
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
• Towards optimizing the deployment of optical access networks
• A MIP-based approach to solve the prize-collecting local access network design problem
• Upgrading nodes in tree-shaped hub location
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots
• Optimizing splitter and fiber location in a multilevel optical FTTH network
• Branch-and-cut-and-price for capacitated connected facility location
• Approximate robust optimization for the connected facility location problem
• MIP modeling of incremental connected facility location
• The incremental connected facility location problem
• A cutting plane algorithm for the capacitated connected facility location problem
• An algorithmic framework for the exact solution of tree-star problems
• The \(p\)-arborescence star problem: formulations and exact solution approaches
• Branch‐and‐cut algorithms for the ‐arborescence star problem
• Heuristic and exact algorithms for minimum-weight non-spanning arborescences
• A branch-and-cut algorithm for the maximum covering cycle problem
• The connected facility location polytope
• Fiber cable network design in tree networks
• Configuration‐based approach for topological problems in the design of wireless sensor networks
• Benders decomposition of the passive optical network design problem
• Solving Steiner trees: Recent advances, challenges, and perspectives
• New formulations for two location problems with interconnected facilities
• Lagrangian decompositions for the two-level FTTx network design problem
• General network design: a unified view of combined location and network design problems
• The online multicommodity connected facility location problem
• A two-level off-grid electric distribution problem on the continuous space
• Exact algorithms for budgeted prize-collecting covering subgraph problems
• Modelling the hop constrained connected facility location problem on layered graphs

Describes a project that uses

Uses Software

• SteinLib
• CPLEX
• OR-Library

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)