Exactly solving a two-level location problem with modular node capacities
From MaRDI portal
Publication:2892154
DOI10.1002/net.20486zbMath1241.90020OpenAlexW2011781861MaRDI QIDQ2892154
Alberto Ceselli, Giuliana Carello, Bernardetta Addis
Publication date: 18 June 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20486
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)
Related Items (7)
A two-level location-allocation problem in designing local access fiber optic networks ⋮ A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime ⋮ The capacitated mobile facility location problem ⋮ Multi-level facility location problems ⋮ Heuristics for the dynamic facility location problem with modular capacities ⋮ Allocating nodes to hubs for minimizing the hubs processing resources: A case study ⋮ Combining very large scale and ILP based neighborhoods for a two-level location problem
Uses Software
Cites Work
- An approximation algorithm for the \(k\)-level capacitated facility location problem
- Facility location models for distribution system design
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
- A review of hierarchical facility location models
- Formulations and relaxations for a multi-echelon capacitated location-distribution problem
- A new approximation algorithm for the multilevel facility location problem
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- An exact algorithm for the capacitated facility location problems with single sourcing
- Upper and lower bounds for the two-level simple plant location problem
- A Lagrangean heuristic for a modular capacitated location problem
- An exact method for the two-echelon, single-source, capacitated facility location problem
- Lower and upper bounds for a two-level hierarchical location problem in computer networks
- On the capacitated concentrator location problem: a reformulation by discretization
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- New facets for the two-stage uncapacitated facility location polytope
- Discretized formulations for capacitated location problems with modular distribution costs
- Using Extra Dual Cuts to Accelerate Column Generation
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
This page was built for publication: Exactly solving a two-level location problem with modular node capacities
