A discretizing algorithm for location problems
From MaRDI portal
(Redirected from Publication:1129969)
Recommendations
- Methods for a class of discrete location problems
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- scientific article; zbMATH DE number 4020810
- A discrete location problem
- scientific article; zbMATH DE number 3856820
- A flexible model and efficient solution strategies for discrete location problems
- A flexible model and efficient solution strategies for discrete location problems
- The discrete p-maxian location problem
- A fast algorithm for the rectilinear distance location problem
- Approximation of solutions for location problems
Cites work
- scientific article; zbMATH DE number 3742987 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3557508 (Why is no real title available?)
- A destination optimality in asymmetric distance Fermat-Weber problems
- A localization property for facility-location problems with arbitrary norms
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Convex Analysis
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- Geometrical properties of the Fermat-Weber problem
- Minimizing a unimodal function of two integer variables
- On the uniqueness of optimal solutions in continuous location theory
- Solving general continuous single facility location problems by cutting planes
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- The Asymmetric Distance Location Problem
- The Minisum and Minimax Location Problems Revisited
Cited in
(24)- An application of the great deluge algorithm in planar location problems
- Using interval analysis for solving planar single-facility location problems: New discarding tests
- Algorithms for location problems based on angular distances
- An approximative lexicographic MIN-MAX approach to the discrete facility location problem
- Approximation of solutions for location problems
- On location-allocation problems for dimensional facilities
- Location problems with different norms for different points
- A flexible model and efficient solution strategies for discrete location problems
- A discrete algorithm for localizing the discontinuity lines of a function of two variables
- scientific article; zbMATH DE number 1967834 (Why is no real title available?)
- A candidate set construction method in distribution center location based on a multi-scale gridding model
- scientific article; zbMATH DE number 3943524 (Why is no real title available?)
- A discrete location problem
- Decomposition of the location problem
- Algorithms of placing recovery points
- Solving general continuous single facility location problems by cutting planes
- Continuous multifacility ordered median location problems
- Discrete Monotonic Optimization with Application to a Discrete Location Problem
- A continuous strategy to solve a class of discrete optimization problems
- A bibliography for some fundamental problem categories in discrete location science
- A Two‐Stage Algorithm for Solving a Discrete Minisum Problem
- scientific article; zbMATH DE number 7234430 (Why is no real title available?)
- Maximin location: Discretization not always works
- A new algorithm for the minimax location problem with the closest distance
This page was built for publication: A discretizing algorithm for location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129969)
