Lower and upper bounds for a capacitated plant location problem with multicommodity flow
From MaRDI portal
Publication:1025254
DOI10.1016/j.cor.2009.01.012zbMath1162.90495OpenAlexW2070141720MaRDI QIDQ1025254
Jinfeng Li, Christian Prins, Feng Chu
Publication date: 18 June 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.01.012
Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
A survey of recent research on location-routing problems, Solution method for the location planning problem of logistics park with variable capacity, Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Location-routing: issues, models and methods
- Using clustering analysis in a capacitated location-routing problem
- A branch-and-price algorithm for the capacitated facility location problem
- A scatter search-based heuristic to locate capacitated transshipment points
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- Models for multimode multicommodity location problems with interdepot balancing requirements
- ADD-heuristics' starting procedures for capacitated plant location models
- Capacitated facility location: Separation algorithms and computational experience
- A heuristic solution to the warehouse location-routing problem
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- A column generation approach to capacitated \(p\)-median problems
- Heuristic solutions to multi-depot location-routing problems
- Future paths for integer programming and links to artificial intelligence
- Efficient Production-Distribution System Design
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- On the Two-Level Uncapacitated Facility Location Problem
- Capacitated facility location/network design problems.
- Planning and coordination of production and distribution facilities for multiple commodities
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
