Solving shortest path problems with a weight constraint and replenishment arcs
暂无分享,去创建一个
[1] Vicky H. Mak-Hau,et al. Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs , 2007, Discret. Appl. Math..
[2] Edgar Alberto Cabral. Wide area telecommunication network design: problems and solution algorithms with application to the alberta supernet , 2005 .
[3] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .
[4] R. K. Wood,et al. Lagrangian relaxation and enumeration for solving constrained shortest-path problems , 2008 .
[5] Martin Desrochers,et al. Computer-Aided Transit Scheduling , 1992 .
[6] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[7] Jacques Desrosiers,et al. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .
[8] George L. Nemhauser,et al. Flight String Models for Aircraft Fleeting and Routing , 1998, Transp. Sci..
[9] François Soumis,et al. An integrated aircraft routing, crew scheduling and flight retiming model , 2005, Comput. Oper. Res..
[10] Mingchu Li,et al. Using Gavish-Grave LP to Formulate the Directed Black and White Traveling Salesman Problem , 2007, International Conference on Computational Science.
[11] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[12] Stefan E. Karisch,et al. Constraint Programming Based Column Generation for Crew Assignment , 2002, J. Heuristics.
[13] Natashia Boland,et al. Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem , 2003, Networks.
[14] Raymond A. Patterson,et al. The network design problem with relays , 2007, Eur. J. Oper. Res..
[15] N. Boland,et al. Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem , 2009 .
[16] Vicky H. Mak-Hau,et al. Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs , 2006, Discret. Optim..
[17] Raymond A. Patterson,et al. Wide area telecommunication network design: application to the Alberta SuperNet , 2008, J. Oper. Res. Soc..
[18] Jacques Desrosiers,et al. Crew Pairing at Air France , 1993 .
[19] Panagiotis Stamatopoulos,et al. Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search , 2002, Ann. Oper. Res..
[20] N. Boland,et al. Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs , 2000 .
[21] Gilbert Laporte,et al. Minimum cost path problems with relays , 2011, Comput. Oper. Res..
[22] Sylvie Gélinas,et al. Locomotive assignment with heterogeneous consists at CN North America , 1997 .
[23] David M. Ryan,et al. Flight Attendant Rostering for Short-Haul Airline Operations , 1997, Oper. Res..
[24] Srini Ramaswamy,et al. Airline Crew Scheduling with Time Windows and Plane-Count Constraints , 2002, Transp. Sci..
[25] Stefan Irnich. Resource extension functions: properties, inversion, and generalization to segments , 2008, OR Spectr..
[26] Jacques Desrosiers,et al. Chapter 2 Time constrained routing and scheduling , 1995 .
[27] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[28] M. Desrochers,et al. A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .
[29] S. Yan,et al. Optimal construction of airline individual crew pairings , 2002, Comput. Oper. Res..
[30] Binay K. Bhattacharya,et al. Approximation Algorithms for the Black and White Traveling Salesman Problem , 2007, COCOON.
[31] Jean-François Cordeau,et al. A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem , 2003, Comput. Oper. Res..
[32] Gilbert Laporte,et al. Heuristics for the black and white traveling salesman problem , 2003, Comput. Oper. Res..
[33] Jean-François Cordeau,et al. Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..
[34] Cynthia Barnhart,et al. Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions , 2003 .
[35] Natashia Boland,et al. Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..
[36] George L. Nemhauser,et al. The aircraft rotation problem , 1997, Ann. Oper. Res..
[37] Gilbert Laporte,et al. The Black and White Traveling Salesman Problem , 2006, Oper. Res..
[38] Stefan Irnich,et al. Shortest Path Problems with Resource Constraints , 2005 .
[39] George L. Nemhauser,et al. Airline Crew Scheduling: A New Formulation and Decomposition Algorithm , 1997, Oper. Res..
[40] George L. Nemhauser,et al. The asymmetric traveling salesman problem with replenishment arcs , 2000, Eur. J. Oper. Res..