The maximum capture problem with heterogeneous customers

DOI10.1016/S0305-0548(99)00040-4zbMath0967.90066OpenAlexW2059383656MaRDI QIDQ1819241

Stefano Benati

Publication date: 3 September 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00040-4

zbMATH Keywords

Lagrangian relaxationcompetitive locationbranch-and-bound methodssubmodularity of the objective functionmaximum capture problemrandom utility function

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Utility theory (91B16) Discrete location and assignment (90B80)

Related Items

The leader-follower location model ⋮ A Lagrangian decomposition scheme for choice-based optimization ⋮ Facility location for market capture when users rank facilities by shorter travel and waiting times ⋮ A comparison of linear reformulations for multinomial logit choice probabilities in facility location models ⋮ A combinatorial approach to level of repair analysis ⋮ Conditional Location Problems on Networks and in the Plane ⋮ The maximum capture problem with random utilities: problem formulation and algorithms