A FAST PARAMETRIC MAXIMUM FLOW ALGORITHM AND APPLICATIONS

[31] FRACTIONAL COVERS FOR FORESTS AND MATCHINGS [J]. MATHEMATICAL PROGRAMMING, 1984, 29 (01) : 1 - 14

[32] Picard J. C., 1975, Networks, V5, P357, DOI 10.1002/net.3230050405

[33] A NETWORK FLOW SOLUTION TO SOME NON-LINEAR 0-1 PROGRAMMING-PROBLEMS, WITH APPLICATIONS TO GRAPH-THEORY [J]. NETWORKS, 1982, 12 (02) : 141 - 159

[34] PICARD JC, 1982, INFOR, V20, P394

[35] PICARD JC, 1976, MANAGE SCI, V11, P1268

[36] SELECTION PROBLEM OF SHARED FIXED COSTS AND NETWORK FLOWS [J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 17 (03): : 200 - 207

[37] Ritter K., 1962, UNTERNEHMENSFORSCHUN, V6, P149

[38] FRACTIONAL PROGRAMMING .2. DINKELBACHS ALGORITHM [J]. MANAGEMENT SCIENCE, 1976, 22 (08) : 868 - 873

[39] DECOMPOSITION ALGORITHMS FOR SINGLE-MACHINE SEQUENCING WITH PRECEDENCE RELATIONS AND DEFERRAL COSTS [J]. OPERATIONS RESEARCH, 1975, 23 (02) : 283 - 298

[40] SELF-ADJUSTING BINARY SEARCH-TREES [J]. JOURNAL OF THE ACM, 1985, 32 (03) : 652 - 686

[31] FRACTIONAL COVERS FOR FORESTS AND MATCHINGS [J]. MATHEMATICAL PROGRAMMING, 1984, 29 (01) : 1 - 14

[32] Picard J. C., 1975, Networks, V5, P357, DOI 10.1002/net.3230050405

[33] A NETWORK FLOW SOLUTION TO SOME NON-LINEAR 0-1 PROGRAMMING-PROBLEMS, WITH APPLICATIONS TO GRAPH-THEORY [J]. NETWORKS, 1982, 12 (02) : 141 - 159

[34] PICARD JC, 1982, INFOR, V20, P394

[35] PICARD JC, 1976, MANAGE SCI, V11, P1268

[36] SELECTION PROBLEM OF SHARED FIXED COSTS AND NETWORK FLOWS [J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 17 (03): : 200 - 207

[37] Ritter K., 1962, UNTERNEHMENSFORSCHUN, V6, P149

[38] FRACTIONAL PROGRAMMING .2. DINKELBACHS ALGORITHM [J]. MANAGEMENT SCIENCE, 1976, 22 (08) : 868 - 873

[39] DECOMPOSITION ALGORITHMS FOR SINGLE-MACHINE SEQUENCING WITH PRECEDENCE RELATIONS AND DEFERRAL COSTS [J]. OPERATIONS RESEARCH, 1975, 23 (02) : 283 - 298

[40] SELF-ADJUSTING BINARY SEARCH-TREES [J]. JOURNAL OF THE ACM, 1985, 32 (03) : 652 - 686