Exactly solving a two-level location problem with modular node capacities
From MaRDI portal
Recommendations
- Solving the hub location problem with modular link capacities
- Capacitated facility location/network design problems.
- scientific article; zbMATH DE number 1803762
- Multi-period capacitated location with modular equipments
- Combining very large scale and ILP based neighborhoods for a two-level location problem
Cites work
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A Lagrangean heuristic for a modular capacitated location problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A new approximation algorithm for the multilevel facility location problem
- A review of hierarchical facility location models
- An approximation algorithm for the k-level capacitated facility location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- An exact method for the two-echelon, single-source, capacitated facility location problem
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
- Discretized formulations for capacitated location problems with modular distribution costs
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Facility location models for distribution system design
- Formulations and relaxations for a multi-echelon capacitated location-distribution problem
- Lower and upper bounds for a two-level hierarchical location problem in computer networks
- New facets for the two-stage uncapacitated facility location polytope
- On the capacitated concentrator location problem: a reformulation by discretization
- Upper and lower bounds for the two-level simple plant location problem
- Using extra dual cuts to accelerate column generation
Cited in
(10)- The capacitated mobile facility location problem
- Multi-level facility location problems
- A combined facility location and network design problem with multi-type of capacitated links
- Heuristics for the dynamic facility location problem with modular capacities
- Combining very large scale and ILP based neighborhoods for a two-level location problem
- Multi-period capacitated location with modular equipments
- A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime
- A two-level location-allocation problem in designing local access fiber optic networks
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- A dynamic capacitated facility location problem with modular capacities and best service assignment: a comparison of formulations
This page was built for publication: Exactly solving a two-level location problem with modular node capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892154)
