Optimal locations and districts of two traveling salesmen on a tree
From MaRDI portal
Publication:3204320
DOI10.1002/net.3230200702zbMath0716.90067OpenAlexW2055386616MaRDI QIDQ3204320
David Simchi-Levi, Oded Berman
Publication date: 1990
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200702
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Queues and service in operations research (90B22) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Multi-depot traveling salesmen location problems on networks with special structure, A taxonomical analysis, current methods and objectives on location-routing problems