Using interval analysis for solving planar single-facility location problems: New discarding tests
From MaRDI portal
Recommendations
- What can interval analysis do for global optimization?
- A new bounding method for single facility location models
- New interval methods for constrained global optimization
- New interval analysis support functions using gradient information in a global minimization algorithm
- A discretizing algorithm for location problems
Cited in
(12)- A robust and efficient algorithm for planar competitive location problems
- Location of retail facilities under conditions of uncertainty
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- A triobjective model for locating a public semiobnoxious facility in the plane
- The 1-center problem in the plane with independent random weights
- New interval methods for constrained global optimization
- Optimality conditions and duality for mathematical programming with equilibrium constraints including multiple interval-valued objective functions on Hadamard manifolds
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
This page was built for publication: Using interval analysis for solving planar single-facility location problems: New discarding tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1595899)
