A parallelized lagrangean relaxation approach for the discrete ordered median problem
From MaRDI portal
Recommendations
- A flexible model and efficient solution strategies for discrete location problems
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- scientific article; zbMATH DE number 1247176
- The discrete ordered median problem: Models and solution methods.
- Exact procedures for solving the discrete ordered median problem
Cites work
- A flexible model and efficient solution strategies for discrete location problems
- A modified variable neighborhood search for the discrete ordered median problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An extended covering model for flexible discrete and equity location problems
- Comparative error bound theory for three location models: continuous demand versus discrete demand
- Exact procedures for solving the discrete ordered median problem
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 1859298 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- scientific article; zbMATH DE number 1394671 (Why is no real title available?)
- Lagrangean relaxation. (With comments and rejoinder).
- Location theory. A unified approach
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Robust mean absolute deviation problems on networks with linear vertex weights
Cited in
(8)- Constructing a DC decomposition for ordered median problems
- A revised variable neighborhood search for the discrete ordered median problem
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- Near-optimal large-scale k-medoids clustering
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Discrete facility location in machine learning
- Benders decomposition for the discrete ordered median problem
This page was built for publication: A parallelized lagrangean relaxation approach for the discrete ordered median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512991)
