INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING

[1] GOMORY R, 1963, INDUSTRIAL SCHEDULIN

[2] GOMORY RE, 1963, RECENT ADVANCES MATH

[3] GOMORY RE, 1960, RM2597 RAND CORP

[4] ON CONNECTIONS BETWEEN ZERO-ONE INTEGER PROGRAMMING AND CONCAVE PROGRAMMING UNDER LINEAR CONSTRAINTS [J]. OPERATIONS RESEARCH, 1969, 17 (04) : 680 - +

[5] RAGHAVACHARI M, 1968, 20 CARN MELL U TECHN

[6] TUY H, 1964, SOV MATH, P1437

[7] TUY H, 1964, DOKLADY AKADEMII NAU

[8] YOUNG R, 1968, NEW CUTS SPECIAL CLA

[1] GOMORY R, 1963, INDUSTRIAL SCHEDULIN

[2] GOMORY RE, 1963, RECENT ADVANCES MATH

[3] GOMORY RE, 1960, RM2597 RAND CORP

[4] ON CONNECTIONS BETWEEN ZERO-ONE INTEGER PROGRAMMING AND CONCAVE PROGRAMMING UNDER LINEAR CONSTRAINTS [J]. OPERATIONS RESEARCH, 1969, 17 (04) : 680 - +

[5] RAGHAVACHARI M, 1968, 20 CARN MELL U TECHN

[6] TUY H, 1964, SOV MATH, P1437

[7] TUY H, 1964, DOKLADY AKADEMII NAU

[8] YOUNG R, 1968, NEW CUTS SPECIAL CLA