Single-facility huff location problems on networks

DOI10.1007/S10479-013-1445-XzbMATH Open1303.90062OpenAlexW2094806792MaRDI QIDQ490213FDOQ490213

Authors R. Blanquero, Emilio Carrizosa, Amaya Nogales-Gómez, Frank Plastria

Publication date 22 January 2015

Published in Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

interval analysislocation on networksDC optimizationhuff location models

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85)

Recommendations

• \(p\)-facility Huff location problem on networks
• Solving a Huff-like Stackelberg location problem on networks
• On minimax-regret Huff location models
• Solving multifacility Huff location models on networks using metaheuristic and exact approaches
• Discretization results for the Huff and Pareto-Huff competitive location models on networks

Cites work

• scientific article; zbMATH DE number 1239298 (Why is no real title available?)
• scientific article; zbMATH DE number 757676 (Why is no real title available?)
• scientific article; zbMATH DE number 956792 (Why is no real title available?)
• A branch & cut algorithm for the windy general routing problem and special cases
• A d.c. optimization method for single facility location problems
• Big segment small segment global optimization algorithm on networks
• Continuous location problems and big triangle small triangle: Constructing better bounds
• DC programming: overview.
• Finding the optimal solution to the Huff based competitive location model
• GBSSS: The generalized big square small square method for planar single- facility location
• Location-allocation of multiple-server service centers with constrained queues or waiting times
• On covering method for d.c. optimization.
• On minimax-regret Huff location models
• Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
• Solving a huff-like competitive location and design model for profit maximization in the plane
• Static competitive facility location: an overview of optimisation approaches.
• TSPLIB—A Traveling Salesman Problem Library
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Minisum and Minimax Location Problems Revisited

Cited in

(7)

• Finding the optimal solution to the Huff based competitive location model
• On minimax-regret Huff location models
• Solving multifacility Huff location models on networks using metaheuristic and exact approaches
• Solving multifacility Huff location models on networks using variable neighborhood search and multi-start local search metaheuristics
• \(p\)-facility Huff location problem on networks
• Solving a Huff-like Stackelberg location problem on networks
• Solving the Huff-based competitive location model on a network with link-based demand

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Single-facility huff location problems on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490213)