An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix

DOI10.1016/S0166-218X(00)00357-7MaRDI QIDQ5954079zbMATH OpenOpenAlexFDO

Authors V. L. Beresnev

Publication date 30 January 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(00)00357-7

zbMATH Keywords

facility locationpolynomial algorithmtotally balanced matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Discrete location and assignment (90B80)

Review text

Translation of Diskretn. Anal. Issled. Oper., Ser. 15, No. 1, 20-31 (1998; Zbl 0913.90153).

Cites work

• scientific article; zbMATH DE number 3867065 (Why is no real title available?)
• scientific article; zbMATH DE number 3700728 (Why is no real title available?)
• Pseudo-Boolean Programming
• The simple plant location problem: Survey and synthesis
• Totally-Balanced and Greedy Matrices

Cited in

(1)

• Totally balanced and totally unimodular matrices defined by center location problems

This page was built for publication: An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix

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