Single-facility huff location problems on networks
From MaRDI portal
Publication:490213
DOI10.1007/s10479-013-1445-xzbMath1303.90062OpenAlexW2094806792MaRDI QIDQ490213
Rafael Blanquero, Amaya Nogales-Gómez, Emilio Carrizosa, 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
Related Items (2)
\(p\)-facility Huff location problem on networks ⋮ Solving a Huff-like Stackelberg location problem on networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On minimax-regret Huff location models
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Continuous location problems and big triangle small triangle: Constructing better bounds
- 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
- A d.c. optimization method for single facility location problems
- DC programming: overview.
- Finding the optimal solution to the Huff based competitive location model
- Big segment small segment global optimization algorithm on networks
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Minisum and Minimax Location Problems Revisited
- TSPLIB—A Traveling Salesman Problem Library
- Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
- A branch & cut algorithm for the windy general routing problem and special cases
- Static competitive facility location: an overview of optimisation approaches.
- On covering method for d.c. optimization.
This page was built for publication: Single-facility huff location problems on networks
