THE INDEFINITE ZERO-ONE QUADRATIC PROBLEM

[1] DUALITY IN DISCRETE PROGRAMMING .2. QUADRATIC CASE [J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 16 (01): : 14 - 32

[2] BARANKIN EW, 1956, ECONOMETRICA, V24, P340

[3] SCHEDULING TO MINIMIZE INTERACTION COST [J]. OPERATIONS RESEARCH, 1966, 14 (01) : 52 - &

[4] CARTER MW, 1979, THESIS U WATERLOO WA

[5] GALLO G, 1980, MATH PROGRAM STUD, V12, P132, DOI 10.1007/BFb0120892

[6] Gill P. E., 1974, Mathematical Programming, V7, P311, DOI 10.1007/BF01585529

[7] GILL PE, 1977, NAC78 NAT PHYS LAB R

[8] CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM [J]. OPERATIONS RESEARCH, 1974, 22 (01) : 180 - 182

[9] FURTHER REDUCTION OF ZERO-ONE POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING PROBLEMS [J]. OPERATIONS RESEARCH, 1973, 21 (01) : 156 - 161

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

[1] DUALITY IN DISCRETE PROGRAMMING .2. QUADRATIC CASE [J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 16 (01): : 14 - 32

[2] BARANKIN EW, 1956, ECONOMETRICA, V24, P340

[3] SCHEDULING TO MINIMIZE INTERACTION COST [J]. OPERATIONS RESEARCH, 1966, 14 (01) : 52 - &

[4] CARTER MW, 1979, THESIS U WATERLOO WA

[5] GALLO G, 1980, MATH PROGRAM STUD, V12, P132, DOI 10.1007/BFb0120892

[6] Gill P. E., 1974, Mathematical Programming, V7, P311, DOI 10.1007/BF01585529

[7] GILL PE, 1977, NAC78 NAT PHYS LAB R

[8] CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM [J]. OPERATIONS RESEARCH, 1974, 22 (01) : 180 - 182

[9] FURTHER REDUCTION OF ZERO-ONE POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING PROBLEMS [J]. OPERATIONS RESEARCH, 1973, 21 (01) : 156 - 161

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