Computing inter-site distances for routing and scheduling problems

DOI10.1016/0167-6377(81)90022-5zbMath0495.90044OpenAlexW2046967559MaRDI QIDQ1169933

Gary A. Kochenberger, George B. Kleindorfer, Edward T. Reutzel

Publication date: 1981

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(81)90022-5

zbMATH Keywords

schedulingroutingdistance matrix determination methodroad structure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A heuristic for the location of a rapid transit line

Cites Work

• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees

This page was built for publication: Computing inter-site distances for routing and scheduling problems