| |
| 1992 | ||
|---|---|---|
| 3 | J. F. Pekny, D. L. Miller: A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. Math. Program. 55: 17-33 (1992) | |
| 1990 | ||
| 2 | EE | J. F. Pekny, D. L. Miller: An Exact Parallel Algorithm for the Resource Constrained Traveling Salesman Problem with Application to Scheduling with an Aggregate Deadline. ACM Conference on Computer Science 1990: 208-214 |
| 1 | EE | J. F. Pekny, D. L. Miller: A Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems. ACM Conference on Computer Science 1990: 56-62 |
| 1 | D. L. Miller | [1] [2] [3] |