Experimental evaluation of solution approaches for the K-route maximum flow problem
暂无分享,去创建一个
[1] D. Bertsekas. An auction algorithm for the max-flow problem , 1995 .
[2] T. B. Boffey. Linear Network Optimization: Algorithms and Codes , 1994 .
[3] Åke Björck,et al. Numerical methods for least square problems , 1996 .
[4] Wataru Kishimoto,et al. A Method for Obtaining the Maximum δ-Reliable Flow in a Network , 1998 .
[5] David W. Hosmer,et al. Applied Logistic Regression , 1991 .
[6] Donald Goldfarb,et al. A computational comparison of the dinic and network simplex methods for maximum flow , 1988 .
[7] Charu C. Aggarwal,et al. On multiroute maximum flows in networks , 2002, Networks.
[8] D. Klingman,et al. NETGEN: A PROGRAM FOR GENERATING LARGE SCALE (UN) CAPACITATED ASSIGNMENT, TRANS-PORTATION, AND MINIMUM COST FLOW NETWORK , 2015 .
[9] David A. Ratkowsky,et al. Handbook of nonlinear regression models , 1990 .
[10] Koushik Kar,et al. Routing restorable bandwidth guaranteed connections using maximum 2-route flows , 2003, TNET.
[11] W. Kishimoto. A method for obtaining the maximum multiroute flows in a network , 1996 .
[12] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .
[13] Wataru Kishimoto,et al. On M-route flows in a network , 1992, [Proceedings] Singapore ICCS/ISITA `92.
[14] Åke Björck,et al. Numerical Methods , 1995, Handbook of Marine Craft Hydrodynamics and Motion Control.
[15] Wataru Kishimoto,et al. Two‐route flows in an undirected flow network , 1993 .