LANGUAGE AND A PROGRAM FOR STATING AND SOLVING COMBINATORIAL PROBLEMS

[31] HAMMER PL, 1970, REV FR INFORM RECH O, V4, P67

[32] HAMMER PL, 1974, MATH PROGRAMMING THE

[33] HANSEN P, 1974, THESIS BRUXELLES

[34] TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J]. OPERATIONS RESEARCH, 1970, 18 (06) : 1138 - &

[35] Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]

[36] HEURGON E, 1972, REV AUTOMAT INFORMAT, V6, P41

[37] KARP RM, 1972, 3 U CAL COMP SCI TEC

[38] AN AUTOMATIC METHOD OF SOLVING DISCRETE PROGRAMMING-PROBLEMS [J]. ECONOMETRICA, 1960, 28 (03) : 497 - 520

[39] LATOMBE JC, 1977, CAD SYSTEMS

[40] LAURIERE JL, 1976, THESIS PARIS 6

[31] HAMMER PL, 1970, REV FR INFORM RECH O, V4, P67

[32] HAMMER PL, 1974, MATH PROGRAMMING THE

[33] HANSEN P, 1974, THESIS BRUXELLES

[34] TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J]. OPERATIONS RESEARCH, 1970, 18 (06) : 1138 - &

[35] Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]

[36] HEURGON E, 1972, REV AUTOMAT INFORMAT, V6, P41

[37] KARP RM, 1972, 3 U CAL COMP SCI TEC

[38] AN AUTOMATIC METHOD OF SOLVING DISCRETE PROGRAMMING-PROBLEMS [J]. ECONOMETRICA, 1960, 28 (03) : 497 - 520

[39] LATOMBE JC, 1977, CAD SYSTEMS

[40] LAURIERE JL, 1976, THESIS PARIS 6