Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows
暂无分享,去创建一个
[1] Andrew V. Goldberg,et al. Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.
[2] Ernesto de Queirós Vieira Martins,et al. An algorithm for the quickest path problem , 1997, Oper. Res. Lett..
[3] P. Hansen. Methods of Nonlinear 0-1 Programming , 1979 .
[4] Hanif D. Sherali,et al. Low Probability - High Consequence Considerations in Routing Hazardous Material Shipments , 1997, Transp. Sci..
[5] Nicos Christofides,et al. An algorithm for the resource constrained shortest path problem , 1989, Networks.
[6] Hokey Min,et al. Multiobjective design of transportation networks: taxonomy and annotation , 1986 .
[7] Giovanni Righini,et al. Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..
[8] Christina Hallam,et al. A Multiobjective Optimal Path Algorithm , 2001, Digit. Signal Process..
[9] Giovanni Righini,et al. New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008 .
[10] I. Murthy,et al. An interactive procedure using domination cones for bicriterion shortest path problems , 1994 .
[11] Arthur Warburton,et al. Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..
[12] R. Musmanno,et al. Label Correcting Methods to Solve Multicriteria Shortest Path Problems , 2001 .
[13] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..
[14] P. Mirchandani,et al. Routing with nonlinear multiattribute cost functions , 1993 .
[15] João C. N. Clímaco,et al. A PC-BASED INTERACTIVE DECISION SUPPORT SYSTEM FOR TWO OBJECTIVE DIRECT DELIVERY PROBLEMS. , 1994 .
[16] C. T. Tung,et al. A multicriteria Pareto-optimal path algorithm , 1992 .
[17] Niklas Kohl,et al. Exact methods for time constrained routing and related scheduling problems , 1995 .
[18] E. Martins. On a special class of bicriterion path problems , 1984 .
[19] J. Desrosiers,et al. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1998 .
[20] A. Aboutahoun. Minimum Cost-Reliability Ratio Path Problem , 2012 .
[21] Dimitri P. Bertsekas,et al. Network optimization : continuous and discrete models , 1998 .
[22] Rajan Batta,et al. Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials , 1988, Oper. Res..
[23] I. Murthy,et al. A parametric approach to solving bicriterion shortest path problems , 1991 .
[24] E. Martins,et al. A bicriterion shortest path algorithm , 1982 .
[25] Francesca Guerriero,et al. The interactive analysis of the multicriteria shortest path problem by the reference point method , 2003, Eur. J. Oper. Res..
[26] John R. Current,et al. Multiobjective transportation network design and routing problems: Taxonomy and annotation , 1993 .
[27] Natashia Boland,et al. Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..
[28] Michel Gendreau,et al. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.
[29] Ernesto de Queirós Vieira Martins. An algorithm to determine a path with minimal cost/capacity ratio , 1984, Discret. Appl. Math..
[30] Dimitri P. Bertsekas,et al. A simple and fast label correcting algorithm for shortest paths , 1993, Networks.
[31] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[32] Jared L. Cohon,et al. An interactive approach to identify the best compromise solution for two objective shortest path problems , 1990, Comput. Oper. Res..
[33] Kim Allan Andersen,et al. A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..
[34] Anna Sciomachen,et al. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks , 1998, Eur. J. Oper. Res..
[35] D. Shier,et al. An empirical investigation of some bicriterion shortest path algorithms , 1989 .
[36] João C. N. Clímaco,et al. An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions , 1999, Comput. Oper. Res..
[37] Sylvie Gélinas,et al. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1994, Networks.
[38] R. Dial. A MODEL AND ALGORITHM FOR MULTICRITERIA ROUTE-MODE CHOICE , 1979 .
[39] João C. N. Clímaco,et al. A bicriterion approach for routing problems in multimedia networks , 2003, Networks.
[40] H. M. Soroush. Optimal paths in bi-attribute networks with fractional cost functions , 2008, Eur. J. Oper. Res..
[41] H. Moskowitz,et al. Generalized dynamic programming for multicriteria optimization , 1990 .
[42] Mordechai I. Henig. The domination property in multicriteria optimization , 1986 .
[43] Warren B. Powell,et al. A generalized threshold algorithm for the shortest path problem with time windows , 1997, Network Design: Connectivity and Facilities Location.
[44] Giovanni Righini,et al. New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.