The multi-level uncapacitated facility location problem is not submodular

DOI10.1016/0377-2217(93)90266-PzbMath0798.90092OpenAlexW2081648281MaRDI QIDQ5906501

Martine Labbé, Ana Isabel Barros

Publication date: 12 April 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90266-p

zbMATH Keywords

branch-and-boundsubmodularitygreedy heuristicmulti-level uncapacitated facility location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (1)

Submodularity and the traveling salesman problem

Cites Work

• A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A cost function property for plant location problems
• Comments on the note of Frieze
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Unnamed Item
• Unnamed Item

This page was built for publication: The multi-level uncapacitated facility location problem is not submodular