Improving solution of discrete competitive facility location problems

DOI10.1007/s11590-015-0930-3zbMath1369.90096OpenAlexW1107508256MaRDI QIDQ526408

Julius Žilinskas, Blas Pelegín, Algirdas Lančinskas, Pascual Fernández

Publication date: 12 May 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0930-3

zbMATH Keywords

genetic algorithmdiscrete optimizationcompetitive facility location

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (7)

Exact approaches for competitive facility location with discrete attractiveness ⋮ Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness ⋮ A discrete competitive facility location model with proportional and binary rules sequentially applied ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule ⋮ Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors ⋮ Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule

Cites Work

• Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
• A bibliography for some fundamental problem categories in discrete location science
• Global optimization
• Static competitive facility location: an overview of optimisation approaches.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving solution of discrete competitive facility location problems