Solving the uncapacited plant location problem on trees

DOI10.1016/0166-218X(94)90200-3zbMath0807.90075OpenAlexW2075307348MaRDI QIDQ1327217

Marie-Christine Costa, Alain Billionnet

Publication date: 1 March 1995

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90200-3

zbMATH Keywords

recurrent cost computationtree-graphuncapacitated plant location problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items (3)

An optimal algorithm for an outerplanar facility location problem with improved time complexity ⋮ Robust fault tolerant uncapacitated facility location ⋮ On the connectedness property of service areas for the Network Facility Location Problem

Cites Work

• The simple plant location problem: Survey and synthesis
• Solving covering problems and the uncapacitated plant location problem on trees
• Totally-Balanced and Greedy Matrices

This page was built for publication: Solving the uncapacited plant location problem on trees