共 21 条
- [1] AARONSON V, 1986, THESIS J HOPKINS U B
- [2] [Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
- [3] BALAS E, 1980, MATH PROGRAM STUD, V12, P37, DOI 10.1007/BFb0120886
- [4] A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM[J]. MATHEMATICAL PROGRAMMING, 1981, 21 (01) : 19 - 46BALAS, ECHRISTOFIDES, N
- [5] AN ALGORITHM FOR SET COVERING PROBLEM[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 31 (01) : 85 - 93BEASLEY, JE
- [6] Church R., 1974, PAP SCI, V32, P101, DOI DOI 10.1007/BF01942293
- [7] SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY[J]. MANAGEMENT SCIENCE, 1980, 26 (05) : 495 - 509CROWDER, HPADBERG, MW
- [8] THE SHORTEST COVERING PATH PROBLEM - AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN[J]. JOURNAL OF REGIONAL SCIENCE, 1984, 24 (02) : 161 - 183CURRENT, JREVELLE, CCOHON, J
- [9] THE MINIMUM-COVERING SHORTEST-PATH PROBLEM[J]. DECISION SCIENCES, 1988, 19 (03) : 490 - 503CURRENT, JREVELLE, CCOHON, J
- [10] THE MAXIMUM COVERING SHORTEST-PATH PROBLEM - A MULTIOBJECTIVE NETWORK DESIGN AND ROUTING FORMULATION[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) : 189 - 199CURRENT, JRVELLE, CSRCOHON, JL