A note on the maximal covering location problem with customer preference ordering

DOI10.1016/J.COR.2026.107594MaRDI QIDQ7348471zbMATH OpenFDO

Authors Elisabeth Gaar, Markus Sinnl

Publication date 15 September 2026

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

Full work available at URL https://doi.org/10.1016/J.COR.2026.107594

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A strengthened formulation for the simple plant location problem with order
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• Closest assignment constraints in discrete location problems
• Intelligent-guided adaptive search for the maximum covering location problem
• Large-scale influence maximization via maximal covering location
• Location science

This page was built for publication: A note on the maximal covering location problem with customer preference ordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348471)