LP EXTREME-POINTS AND CUTS FOR THE FIXED-CHARGE NETWORK DESIGN PROBLEM

[11] GUIGNARD M, 1980, MATH PROGRAM STUD, V12, P150, DOI 10.1007/BFb0120893

[12] THE EVEN-PATH PROBLEM FOR GRAPHS AND DIGRAPHS [J]. NETWORKS, 1984, 14 (04) : 507 - 513

[13] Lawler E.L., 1976, COMBINATORIAL OPTIMI

[14] MAGNANTI TL, 1986, MATH PROGRAM STUD, V26, P112, DOI 10.1007/BFb0121090

[15] NETWORK DESIGN AND TRANSPORTATION-PLANNING - MODELS AND ALGORITHMS [J]. TRANSPORTATION SCIENCE, 1984, 18 (01) : 1 - 55

[16] ACCELERATING BENDERS DECOMPOSITION - ALGORITHMIC ENHANCEMENT AND MODEL SELECTION CRITERIA [J]. OPERATIONS RESEARCH, 1981, 29 (03) : 464 - 484

[17] POWELL W, 1983, TRANSPORT RES B-METH, V17, P471, DOI [10.1016/0191-2615(83)90033-4, 10.1016/0191-2607(83)90167-X]

[18] Rardin R., 1979, J7918 GEORG I TECHN

[19] Schrijver Alexander, 1980, COMBINATORICS 79, V9, P291, DOI DOI 10.1016/S0167-5060(08)70085-2

[20] A DUAL ASCENT APPROACH FOR STEINER TREE PROBLEMS ON A DIRECTED GRAPH [J]. MATHEMATICAL PROGRAMMING, 1984, 28 (03) : 271 - 287

[11] GUIGNARD M, 1980, MATH PROGRAM STUD, V12, P150, DOI 10.1007/BFb0120893

[12] THE EVEN-PATH PROBLEM FOR GRAPHS AND DIGRAPHS [J]. NETWORKS, 1984, 14 (04) : 507 - 513

[13] Lawler E.L., 1976, COMBINATORIAL OPTIMI

[14] MAGNANTI TL, 1986, MATH PROGRAM STUD, V26, P112, DOI 10.1007/BFb0121090

[15] NETWORK DESIGN AND TRANSPORTATION-PLANNING - MODELS AND ALGORITHMS [J]. TRANSPORTATION SCIENCE, 1984, 18 (01) : 1 - 55

[16] ACCELERATING BENDERS DECOMPOSITION - ALGORITHMIC ENHANCEMENT AND MODEL SELECTION CRITERIA [J]. OPERATIONS RESEARCH, 1981, 29 (03) : 464 - 484

[17] POWELL W, 1983, TRANSPORT RES B-METH, V17, P471, DOI [10.1016/0191-2615(83)90033-4, 10.1016/0191-2607(83)90167-X]

[18] Rardin R., 1979, J7918 GEORG I TECHN

[19] Schrijver Alexander, 1980, COMBINATORICS 79, V9, P291, DOI DOI 10.1016/S0167-5060(08)70085-2

[20] A DUAL ASCENT APPROACH FOR STEINER TREE PROBLEMS ON A DIRECTED GRAPH [J]. MATHEMATICAL PROGRAMMING, 1984, 28 (03) : 271 - 287