Approximation of solutions for location problems
From MaRDI portal
This paper is devoted to a class of location problems with polyhedral norms. The objective function is shown to be a piecewise convex function which has to be maximized. We prove that the optimal locations belong to a finite set of intersection points, and we present an efficient method operating upon this finite set and providing a strict local maximum with few computational effort.
Recommendations
- Continuous approximation formulas for location problems
- scientific article; zbMATH DE number 2050759
- scientific article; zbMATH DE number 1670526
- A comparison continuous approximation with mathematical programming approach to location problems
- Approximation schemes for k-facility location
- Methods for a class of discrete location problems
- A discretizing algorithm for location problems
- Location of best simultaneous approximations
- Technical Note—On the Complexity of Some Classes of Location Problems
- Models, algorithms and applications for location problems
Cites work
- A computation procedure for the exact solution of location-allocation problems with rectangular distances
- Convex Analysis
- Geometrical properties of the Fermat-Weber problem
- Heuristic Methods for Location-Allocation Problems
- Location Theory, Dominance, and Convexity
- Location-Allocation Problems
- Some Properties of Location Problems with Block and Round Norms
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Using Block Norms for Location Modeling
Cited in
(33)- A discretizing algorithm for location problems
- Improved complexity bounds for location problems on the real line
- The complementary convex structure in global optimization
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
- Weber problems with alternative transportation systems
- A projection method for \(l_ p\) norm location-allocation problems
- Anchored hyperplane location problems
- Coradiant-valued maps and approximate solutions in variable ordering structures
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Decomposition of the location problem
- The bicriterion semi-obnoxious location (BSL) problem solved by an -approximation
- A d.c. optimization method for single facility location problems
- DC programming: overview.
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- General models in min-max continuous location: Theory and solution techniques
- εVariational inequalities for vector approximation problems
- On statistical bounds of heuristic solutions to location problems
- scientific article; zbMATH DE number 7234430 (Why is no real title available?)
- The locator problem
- Methods for a class of discrete location problems
- Un algorithme pour résoudre une famille de problèmes de localisation multisources
- scientific article; zbMATH DE number 3976799 (Why is no real title available?)
- Location of best simultaneous approximations
- Reliable solution of special event location problems for ODEs
- scientific article; zbMATH DE number 1967834 (Why is no real title available?)
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- Algorithms for location problems based on angular distances
- ∊-Variational inequalities in partially ordered spaces
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- A solvable case of the location problem
- Solving nonconvex planar location problems by finite dominating sets
- Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization
- On approximate efficiency in multiobjective programming
This page was built for publication: Approximation of solutions for location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821683)
