The point-to-point delivery and connection problems: complexity and algorithms
Authors:
- Chung-Lun LiCLChung-Lun Li
- S.Thomas McCormickSMS.Thomas McCormick
- David Simchi-LeviDSDavid Simchi-Levi
- 1 May 1992
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 36 (3) , 267-292
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Routing in Point-to-Point Delivery Systems: Formulations and Solution HeuristicsTransportation Science, 1990
- The complexity of finding two disjoint paths with min-max objective functionDiscrete Applied Mathematics, 1990
- Send-and-Split Method for Minimum-Concave-Cost Network FlowsMathematics of Operations Research, 1987
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a GraphJournal of the ACM, 1978
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- Rectilinear steiner trees: Efficient special‐case algorithmsNetworks, 1977
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- The steiner problem in graphsNetworks, 1971