An improved branch \& bound method for the uncapacitated competitive location problem

DOI10.1023/A:1026182020346zbMath1038.90042OpenAlexW182004018MaRDI QIDQ1413748

Stefano Benati

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

zbMATH Keywords

heuristic concentrationsubmodular functionsrandom utility theorycompetitive location modelsdata-correcting method

Mathematics Subject Classification ID

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

Related Items (7)

Competitive location and pricing on networks with random utilities ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms ⋮ Constraint generation approaches for submodular function maximization leveraging graph properties ⋮ Maximization of submodular functions: theory and enumeration algorithms ⋮ A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem ⋮ Conditional Location Problems on Networks and in the Plane

This page was built for publication: An improved branch \& bound method for the uncapacitated competitive location problem