A computational study of a nonlinear minsum facility location problem
From MaRDI portal
Publication:1761206
DOI10.1016/j.cor.2012.01.009zbMath1251.90015OpenAlexW2039988720MaRDI QIDQ1761206
Igor' Leonidovich Vasilyev, Anton Vladimirovich Ushakov, Emilio Carrizosa
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/107471
Nonlinear programming (90C30) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem ⋮ A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions ⋮ Discrete facility location in machine learning ⋮ Variable neighborhood search for minimum sum-of-squares clustering on networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(p\)-median problem: a survey of metaheuristic approaches
- Computational study of large-scale \(p\)-median problems
- Discrete facility location with nonlinear diseconomies in fixed costs
- Optimal partitioning of a data set based on the \(p\)-median model
- An effective heuristic for large-scale capacitated facility location problems
- An aggregation heuristic for large scale p-median problem
- Lagrangean heuristics for location problems
- The simple plant location problem: Survey and synthesis
- Facility location with increasing production costs
- A decomposition approach for a very large scale optimal diversity management problem
- Capacitated facility location problem with general setup cost
- Cluster Analysis: An Application of Lagrangian Relaxation
- Solution methods for thep-median problem: An annotated bibliography
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Discrete facility location with nonlinear facility costs
- Optimal Facility Location with Concave Costs
- The facility location problem with general cost functions
- Finding the Number of Clusters in a Dataset
- A Heuristic Method for the Set Covering Problem
- The Optimal Diversity Management Problem
- A fractional model for locating semi-desirable facilities on networks