A two-echelon joint continuous-discrete location model
From MaRDI portal
Publication:1683143
DOI10.1016/j.ejor.2017.03.077zbMath1375.90176OpenAlexW2605091857MaRDI QIDQ1683143
Kamlesh Mathur, Ronald H. Ballou, Arulanantha P. P. Maruthasalam, Prahalad Venkateshan
Publication date: 6 December 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.077
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facility location models for distribution system design
- A continuous location-allocation problem with zone-dependent fixed cost
- A perturbation-based heuristic for the capacitated multisource Weber problem
- A review of hierarchical facility location models
- A branch-and-price algorithm for the multi-source Weber problem
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Facility location and supply chain management. A review
- Locating and staffing service centers under service level constraints
- An optimal method for solving the (generalized) multi-Weber problem
- A projection method for \(l_ p\) norm location-allocation problems
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming
- Heuristic cluster algorithm for multiple facility location-allocation problem
- Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
- An Overview of Representative Problems in Location Research
- Properties and Solution Methods for Large Location-Allocation Problems
- Multicommodity Distribution System Design by Benders Decomposition
- Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
- A computation procedure for the exact solution of location-allocation problems with rectangular distances
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Heuristic Methods for Location-Allocation Problems
- The multi-source Weber problem with constant opening cost
- Least squares quantization in PCM
- Location Science
- A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
- Exact and approximate solutions to the multisource weber problem
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
