A heuristic approach to hard constrained shortest path problems
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Richard M. Karp,et al. Parametric shortest path algorithms with an application to cyclic staffing , 1981, Discret. Appl. Math..
[3] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[4] Y. Aneja,et al. The constrained shortest path problem , 1978 .
[5] Jacques Desrosiers,et al. Routing with Time Windows: Synthesis , 1983 .
[6] Gabriel Y. Handler,et al. A dual algorithm for the constrained shortest path problem , 1980, Networks.
[7] Romesh Saigal,et al. Letter to the Editor - A Constrained Shortest Route Problem , 1968, Oper. Res..
[8] Celso C. Ribeiro,et al. A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems , 1984 .
[9] Harvey J. Everett. Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .
[10] Jonathan Halpern,et al. Shortest path with time constraints on movement and parking , 1974, Networks.
[11] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[12] H. Joksch. The shortest route problem with constraints , 1966 .