The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
From MaRDI portal
Publication:3637414
DOI10.1287/opre.1030.0077zbMath1165.90552OpenAlexW2074660787MaRDI QIDQ3637414
Publication date: 10 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/79991eab236fc2b670160a2f4d7a02c327242ce8
Related Items
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location ⋮ A note on equity across groups in facility location ⋮ Equitable service by a facility: minimizing the Gini coefficient ⋮ Covering part of a planar network ⋮ The planar multifacility collection depots location problem ⋮ The quintile share ratio in location analysis ⋮ Solving the ordered one-median problem in the plane ⋮ Location of a distribution center for a perishable product ⋮ Extensions to the Weber problem ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ Voronoi diagrams with overlapping regions ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ Continuous location of an assembly station ⋮ Equity models in planar location ⋮ Locating a minisum annulus: a new partial coverage distance model ⋮ A BSSS algorithm for the location problem with minimum square error ⋮ The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ Review of obnoxious facilities location problems ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ Competitive facility location under attrition ⋮ A directional approach to gradual cover ⋮ Multipurpose shopping trips and location ⋮ The Weber Location Problem: The Threshold Objective ⋮ The obnoxious competitive facility location model ⋮ A refinement of the gravity model for competitive facility location ⋮ Gradual cover competitive facility location ⋮ A global optimization procedure for the location of a median line in the three-dimensional space ⋮ Locating a competitive facility in the plane with a robustness criterion ⋮ Geometric branch-and-bound methods for constrained global optimization problems ⋮ A branch-and-bound approach for estimating covering functionals of convex bodies ⋮ Unnamed Item ⋮ Fitting concentric circles to measurements ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ Geometric fit of a point set by generalized circles ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ Single-facility huff location problems on networks ⋮ A stochastic gradual cover location problem ⋮ Location of a facility minimizing nuisance to or from a planar network ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ New local searches for solving the multi-source Weber problem ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ Maximizing the minimum cover probability by emergency facilities ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Theoretical rate of convergence for interval inclusion functions ⋮ Generalized coverage: new developments in covering location models ⋮ On minimax-regret Huff location models ⋮ Optimizing the location of a production firm ⋮ Facility dependent distance decay in competitive location ⋮ A general global optimization approach for solving location problems in the plane ⋮ Directional approach to gradual cover: the continuous case ⋮ On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems ⋮ Solving scheduling and location problems in the plane simultaneously ⋮ The big cube small cube solution method for multidimensional facility location problems ⋮ A robust and efficient algorithm for planar competitive location problems ⋮ Location of retail facilities under conditions of uncertainty ⋮ Location with acceleration-deceleration distance ⋮ On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems ⋮ Constructing a DC decomposition for ordered median problems ⋮ Continuous location problems and big triangle small triangle: Constructing better bounds ⋮ Big segment small segment global optimization algorithm on networks
