\(p\)-facility Huff location problem on networks
From MaRDI portal
Publication:323476
DOI10.1016/j.ejor.2016.04.039zbMath1346.90480OpenAlexW2396826172MaRDI QIDQ323476
Boglárka G.-Tóth, Emilio Carrizosa, Amaya Nogales-Gómez, Rafael Blanquero
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.04.039
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Single-facility huff location problems on networks
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Handbook of global optimization
- Solving the multiple competitive facilities location problem
- Solving the Huff-based competitive location model on a network with link-based demand
- Optimal location and design of a competitive facility
- Finding the optimal solution to the Huff based competitive location model
- Solving the median problem with continuous demand on a network
- Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics
- Big segment small segment global optimization algorithm on networks
- TSPLIB—A Traveling Salesman Problem Library
- Cooperative covering problems on networks
- Competitive Location Models: A Framework and Bibliography
- A branch & cut algorithm for the windy general routing problem and special cases
- Static competitive facility location: an overview of optimisation approaches.
This page was built for publication: \(p\)-facility Huff location problem on networks
