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

DOI10.1016/S0166-218X(00)00357-7zbMath1024.90048OpenAlexW2007855183MaRDI QIDQ5954079

Vladimir 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

polynomial algorithmfacility locationtotally balanced matrix

Mathematics Subject Classification ID

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

Cites Work

• The simple plant location problem: Survey and synthesis
• Totally-Balanced and Greedy Matrices
• Pseudo-Boolean Programming
• Unnamed Item
• Unnamed Item

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