An improved branch \& bound method for the uncapacitated competitive location problem
From MaRDI portal
Publication:1413748
DOI10.1023/A:1026182020346zbMath1038.90042MaRDI QIDQ1413748
Publication date: 17 November 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026182020346
heuristic concentration; submodular functions; random utility theory; competitive location models; data-correcting method
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B80: Discrete location and assignment
Related Items
Conditional Location Problems on Networks and in the Plane, Constraint generation approaches for submodular function maximization leveraging graph properties, A Lagrangian heuristic algorithm for a public healthcare facility location problem, Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms, Maximization of submodular functions: theory and enumeration algorithms, Competitive location and pricing on networks with random utilities, A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem