On minimax-regret Huff location models

DOI10.1016/j.cor.2010.04.001zbMath1231.90263OpenAlexW1995038480MaRDI QIDQ709114

Lenys Bello, Emilio Carrizosa, Rafael Blanquero

Publication date: 15 October 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationcontinuous locationminimax regretDC functionsHuff modelDCM functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80)

Related Items

Solving the median problem with continuous demand on a network, Locating a competitive facility in the plane with a robustness criterion, \(k\)-balanced center location problem: a new multi-objective facility location problem, Single-facility huff location problems on networks

Cites Work

• Solving a huff-like competitive location and design model for profit maximization in the plane
• A general global optimization approach for solving location problems in the plane
• Location of retail facilities under conditions of uncertainty
• Continuous location problems and big triangle small triangle: Constructing better bounds
• A D.C. biobjective location model
• A d.c. optimization method for single facility location problems
• Finding the optimal solution to the Huff based competitive location model
• Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Minisum and Minimax Location Problems Revisited
• Retail facility location under changing market conditions
• A Class of Solutions for Group Decision Problems
• Optimization of the norm of a vector-valued DC function and applications
• Unnamed Item
• Unnamed Item