Continuous location problems and big triangle small triangle: Constructing better bounds

DOI10.1007/s10898-008-9381-zzbMath1189.90085OpenAlexW2034721242MaRDI QIDQ1037367

Rafael Blanquero, Emilio Carrizosa

Publication date: 16 November 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/47869

zbMATH Keywords

dc monotonic functions

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (20)

Solving the median problem with continuous demand on a network ⋮ \(p\)-facility Huff location problem on networks ⋮ A cross-monotonic cost-sharing scheme for the concave facility location game ⋮ Continuous location of an assembly station ⋮ The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ The multicriteria big cube small cube method ⋮ Solving the 1-median problem on a network with continuous demand and demand surplus ⋮ 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 maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ Single-facility huff location problems on networks ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Theoretical rate of convergence for interval inclusion functions ⋮ On the norm of a dc function ⋮ On minimax-regret Huff location models ⋮ Solving a Huff-like Stackelberg location problem on networks

Cites Work

• Equity models in planar location
• A general global optimization approach for solving location problems in the plane
• GBSSS: The generalized big square small square method for planar single- facility location
• Finding GM-estimators with global optimization techniques
• Finding the optimal solution to the Huff based competitive location model
• The gradual covering problem
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Minisum and Minimax Location Problems Revisited

This page was built for publication: Continuous location problems and big triangle small triangle: Constructing better bounds