A two-echelon joint continuous-discrete location model
type: Item
instance of: scholarly article
title: A two-echelon joint continuous-discrete location model
zbMATH Open document ID: 1375.90176
author: Prahalad Venkateshan
author: Ronald H. Ballou
author: Kamlesh Mathur
author: Arulanantha P. P. Maruthasalam
published in: European Journal of Operational Research
publication date: 2017-12-06T00:00:00Z
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 6816199
zbMATH Keywords: location
zbMATH Keywords: column generation
zbMATH Keywords: multisource Weber problem
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.03.077
OpenAlex ID: W2605091857
cites work: Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
cites work: A projection method for \(l_ p\) norm location-allocation problems
cites work: An Overview of Representative Problems in Location Research
cites work: Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming
cites work: Q4826162
cites work: Q4359509
cites work: The multi-source Weber problem with constant opening cost
cites work: A continuous location-allocation problem with zone-dependent fixed cost
cites work: Solution of the multisource Weber and conditional Weber problems by d. -c. programming
cites work: Heuristic Methods for Location-Allocation Problems
cites work: A review of hierarchical facility location models
cites work: Q3147658
cites work: Q4532026
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Q4320084
cites work: Facility location models for distribution system design
cites work: Exact and approximate solutions to the multisource weber problem
cites work: Location Science
cites work: Least squares quantization in PCM
cites work: Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
cites work: Properties and Solution Methods for Large Location-Allocation Problems
cites work: A computation procedure for the exact solution of location-allocation problems with rectangular distances
cites work: Region-rejection based heuristics for the capacitated multi-source Weber problem
cites work: Facility location and supply chain management. A review
cites work: Q3993417
cites work: Heuristic cluster algorithm for multiple facility location-allocation problem
cites work: On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
cites work: A branch-and-price algorithm for the multi-source Weber problem
cites work: An optimal method for solving the (generalized) multi-Weber problem
cites work: Q3518678
cites work: A modified Weiszfeld algorithm for the Fermat-Weber location problem
cites work: Locating and staffing service centers under service level constraints
cites work: A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
cites work: A perturbation-based heuristic for the capacitated multisource Weber problem
DOI: 10.1016/J.EJOR.2017.03.077
description: scientific article; zbMATH DE number 6816199