BRANCH-AND-BOUND METHODS - A SURVEY

[1] ABADIE J, AUG COMPT C PAR

[2] BALAS E, 1964, CR HEBD ACAD SCI, V258, P5136

[3] AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J]. OPERATIONS RESEARCH, 1965, 13 (04) : 517 - &

[4] BALAS E, 1964, CR HEBD ACAD SCI, V258, P3817

[5] BALAS E, MAY IFIP C NEW YORK

[6] BEALE EML, 3 ACT C INT RECH OP, P780

[7] DYNAMIC PROGRAMMING TREATMENT OF TRAVELLING SALESMAN PROBLEM [J]. JOURNAL OF THE ACM, 1962, 9 (01) : 61 - &

[8] BELLMAN R, APPLIED DYNAMIC PROG

[9] BENDERS JF, MAR RAND S MATH PROG

[10] BERTIER P, 1964, CAHIERS CTR ETUDES R, V6, P202

[1] ABADIE J, AUG COMPT C PAR

[2] BALAS E, 1964, CR HEBD ACAD SCI, V258, P5136

[3] AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J]. OPERATIONS RESEARCH, 1965, 13 (04) : 517 - &

[4] BALAS E, 1964, CR HEBD ACAD SCI, V258, P3817

[5] BALAS E, MAY IFIP C NEW YORK

[6] BEALE EML, 3 ACT C INT RECH OP, P780

[7] DYNAMIC PROGRAMMING TREATMENT OF TRAVELLING SALESMAN PROBLEM [J]. JOURNAL OF THE ACM, 1962, 9 (01) : 61 - &

[8] BELLMAN R, APPLIED DYNAMIC PROG

[9] BENDERS JF, MAR RAND S MATH PROG

[10] BERTIER P, 1964, CAHIERS CTR ETUDES R, V6, P202