The generalized P‐forest problem on a tree network

DOI10.1002/net.3230220302zbMath0772.90057OpenAlexW2059864195MaRDI QIDQ3993630

Timothy J. Lowe, Arie Tamir

Publication date: 23 July 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230220302

zbMATH Keywords

polynomial algorithmgeneralized \(P\)-forest problemmultifacility problems on tree networks

Mathematics Subject Classification ID

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

Related Items (13)

Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ The \(p\)-hub center allocation problem ⋮ Extensive facility location problems on networks: an updated review ⋮ General network design: a unified view of combined location and network design problems ⋮ Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees ⋮ Finding the conditional location of a median path on a tree ⋮ Location routing problems on trees ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ A review of extensive facility location in networks ⋮ Minimax regret path location on trees ⋮ An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs ⋮ The centdian subtree on tree networks

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: The generalized P‐forest problem on a tree network