The incremental connected facility location problem

DOI10.1016/j.cor.2019.104763zbMath1458.90409OpenAlexW2966642576MaRDI QIDQ2329719

Andreas Bley, Ashwin Arulselvan, Ivana Ljubić

Publication date: 18 October 2019

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

Full work available at URL: https://strathprints.strath.ac.uk/69136/

zbMATH Keywords

mixed integer programmingfacility locationbranch-and-cutincremental network designmulti-period network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

A two-level off-grid electric distribution problem on the continuous space ⋮ An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incremental network design with shortest paths
• Network construction problems with due dates
• 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
• MIP models for connected facility location: a theoretical and computational study
• Incremental network design with maximum flows
• Lagrangian decompositions for the two-level FTTx network design problem
• The multi-period incremental service facility location problem
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• An algorithmic framework for the exact solution of tree-star problems
• Strategic facility location: A review
• Connected facility location via random facility sampling and core detouring
• Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
• A cutting plane algorithm for the capacitated connected facility location problem
• A note on the set union knapsack problem
• Separation algorithms for 0-1 knapsack polytopes
• Dual-Based Local Search for the Connected Facility Location and Related Problems
• Incremental Network Design with Minimum Spanning Trees
• MIP Modeling of Incremental Connected Facility Location
• The Push Tree problem
• Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation
• Optimal Network Capacity Planning: A Shortest-Path Scheme
• Facets of the Knapsack Polytope From Minimal Covers
• A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
• An incremental algorithm for the uncapacitated facility location problem
• On building minimum cost communication networks over time
• Optimal expansion of an existing network

This page was built for publication: The incremental connected facility location problem