The big cube small cube solution method for multidimensional facility location problems
From MaRDI portal
Publication:733529
DOI10.1016/j.cor.2009.03.031zbMath1171.90451OpenAlexW2038511562MaRDI QIDQ733529
Publication date: 16 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.03.031
global optimizationcontinuous location\(p\)-median problemnon-differentiable optimizationapproximation algorithmsfacility location problemFermat-Weber problem
Related Items (34)
Covering part of a planar network ⋮ The quintile share ratio in location analysis ⋮ Location equilibria for a continuous competitive facility location problem under delivered pricing ⋮ New heuristic algorithms for solving the planar \(p\)-median problem ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set ⋮ The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ The multicriteria big cube small cube method ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights ⋮ One-dimensional center-based l 1-clustering method ⋮ Multipurpose shopping trips and location ⋮ Obnoxious facility location in multiple dimensional space ⋮ The obnoxious competitive facility location model ⋮ A refinement of the gravity model for competitive facility location ⋮ A global optimization procedure for the location of a median line in the three-dimensional space ⋮ A branch-and-bound approach for estimating covering functionals of convex bodies ⋮ Competitive facility location and design with reactions of competitors already in the market ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fitting concentric circles to measurements ⋮ Locating an axis-parallel rectangle on a Manhattan plane ⋮ A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ Geometric fit of a point set by generalized circles ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Classical and inverse median location problems under uncertain environment ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ New local searches for solving the multi-source Weber problem ⋮ A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Generating good starting solutions for the p-median problem in the plane ⋮ Big segment small segment global optimization algorithm on networks
Cites Work
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- A general global optimization approach for solving location problems in the plane
- Locating a minisum circle in the plane
- Global optimization using interval analysis - the multi-dimensional case
- GBSSS: The generalized big square small square method for planar single- facility location
- Global optimization using interval analysis: The one-dimensional case
- Locating lines and hyperplanes. Theory and algorithms
- Weber's problem with attraction and repulsion under polyhedral gauges
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- A new multisection technique in interval methods for global optimization
- A d.c. optimization method for single facility location problems
- The Fermat-Weber location problem revisited
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
- On the Complexity of Some Common Geometric Location Problems
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Minisum and Minimax Location Problems Revisited
- The multiple server location problem
- On the circle closest to a set of points
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The big cube small cube solution method for multidimensional facility location problems
