The precedence-constrained asymmetric traveling salesman polytope
暂无分享,去创建一个
[1] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[2] Martin Grötschel,et al. On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem , 1990, Conference on Integer Programming and Combinatorial Optimization.
[3] W. R. Pulleyblank,et al. Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design , 1992 .
[4] Giovanni Rinaldi,et al. Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..
[5] Egon Balas,et al. A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets , 1993, Math. Program..
[6] Harilaos N. Psaraftis,et al. A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .