The Round-Trip p-Center and Covering Problem on a Tree

DOI10.1287/TRSC.19.3.222MaRDI QIDQ3745587zbMATH OpenOpenAlexFDO

Authors Antoon W. J. Kolen

Publication date 1985

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.19.3.222

zbMATH Keywords

minimize the maximum round-trip costpolynomial timeround- trip covering problemround-trip p-center problemstrong duality resulttree

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05) Combinatorial optimization (90C27)

Recommendations

• One-way and round-trip center location problems
• On the round-trip 1-center and 1-median problems
• Efficient algorithms for the round-trip 1-center and 1-median problems
• scientific article; zbMATH DE number 4202013
• scientific article; zbMATH DE number 3843458

Cited in

(12)

• Center location problems on tree graphs with subtree-shaped customers
• \((r,p)\)-centroid problems on paths and trees
• Counting clique trees and computing perfect elimination schemes in parallel
• A note on the robust 1-center problem on trees
• A column generation approach for location-routing problems with pickup and delivery
• One-way and round-trip center location problems
• Efficient algorithms for the round-trip 1-center and 1-median problems
• A taxonomical analysis, current methods and objectives on location-routing problems
• On the round-trip 1-center and 1-median problems
• Distribution network design on the battlefield
• A polynomial algorithm for thep-centdian problem on a tree
• Location-routing: issues, models and methods

This page was built for publication: The Round-Trip p-Center and Covering Problem on a Tree

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