A capacitated facility location problem with constrained backlogging probabilities
From MaRDI portal
Publication:5428725
DOI10.1080/00207540600823195zbMath1126.90376OpenAlexW2063834841MaRDI QIDQ5428725
F. J. F. Silva, D. S. de la Figuera
Publication date: 26 November 2007
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600823195
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Dynamic-demand capacitated facility location problems with and without relocation ⋮ Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics ⋮ Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics
Cites Work
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Heuristics for the capacitated plant location model
- An algorithm for solving large capacitated warehouse location problems
- The capacitated plant location problem
- Upper and lower bounds for the single source capacitated location problem.
- Lagrangean heuristics for location problems
- Exact solution methods for uncapacitated location problems with convex transportation costs
- The simple plant location problem: Survey and synthesis
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Integer Programming: Methods, Uses, Computations
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- An Analysis of Private and Public Sector Location Models
