Using Interval Analysis for Solving Planar Single-Facility Location Problems: New Discarding Tests

Authors:
José Fernández;Blas Pelegrín
Affiliations:
Departamento de Estadística e Investigación Operativa, Universidad de Murcia, 30100 Espinardo, Murcia, Spain E-mail: josefdez@um.es;Departamento de Estadística e Investigación Operativa, Universidad de Murcia, 30100 Espinardo, Murcia, Spain
Venue:
Journal of Global Optimization
Year:
2001

Citing 7
Cited 4

New computer methods for global optimization

New computer methods for global optimization
New results on verified global optimization

Computing
Subdivision Direction Selection in Interval Methods for Global Optimization

SIAM Journal on Numerical Analysis
On proving existence of feasible points in equality constrained optimization problems

Mathematical Programming: Series A and B
A new multisection technique in interval methods for global optimization

Computing
Pascal-XSC: Language Reference with Examples

Pascal-XSC: Language Reference with Examples
Estimating actual distances by norm functions: a comparison between the lk,p,θ-norm and the lb1, b2, θ-norm and a study about the selection of the data set

Computers and Operations Research - Location analysis

The 1-center problem in the plane with independent random weights

Computers and Operations Research
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models

Computers and Operations Research
Solving the multiple competitive facilities location and design problem on the plane

Evolutionary Computation
Parallel algorithms for continuous multifacility competitive location problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interval analysis is a powerful tool which allows the design of branch-and-bound methods able to solve many global optimization problems. The key to the speed of those methods is the use of several tests to discard boxes or parts of boxes in which no optimal point may occur. In this paper we present three new discarding tests for two-dimensional problems which are specially suitable for planar single-facility location problems. The usefulness of the new tests is shown by a computational study.