Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule
DOI10.1016/J.CAM.2020.113200zbMATH Open1456.90097OpenAlexW3088077583MaRDI QIDQ2222142FDOQ2222142
Authors: B. Pelegrin, Algirdas Lančinskas, Julius Žilinskas, P. Fernández 
Publication date: 3 February 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2020.113200
Recommendations
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- A discrete competitive facility location model with proportional and binary rules sequentially applied
- A competitive facility location model and an algorithm based on variable attractiveness
- Estimating the Pareto front of a hard bi-criterion competitive facility location problem
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A bibliography for some fundamental problem categories in discrete location science
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- Finding the optimal solution to the Huff based competitive location model
- An exact procedure and LP formulations for the leader-follower location problem
- Discretization results for the Huff and Pareto-Huff competitive location models on networks
- Title not available (Why is that?)
- Improving solution of discrete competitive facility location problems
Cited In (6)
- Service expansion for chained business facilities under congestion and market competition
- A discrete competitive facility location model with proportional and binary rules sequentially applied
- Sequential customers' decisions in facility location with comparison-shopping
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution
- Foreword to the virtual special issue dedicated to the 3rd international conference NUMTA 2019 ``Numerical computations: theory and algorithms
- Population-based algorithm for discrete facility location with ranking of candidate locations
Uses Software
This page was built for publication: Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222142)
