Narrow search
Showing 1 - 10 of 15
Cover Image
A new polynomially bounded shortest path algorithm
Glover, Fred - In: Operations research 33 (1985) 1, pp. 65-73
Persistent link: https://www.econbiz.de/10001019541
Cover Image
A multiphase-dual algorithm for the zero-one integer programming problem
Glover, Fred - In: Operations research 13 (1965) 6, pp. 879-919
Persistent link: https://www.econbiz.de/10002452050
Cover Image
A new foundation for a simplified primal integer programming algorithm
Glover, Fred - In: Operations research 16 (1968) 4, pp. 727-740
Persistent link: https://www.econbiz.de/10002452069
Cover Image
A note on linear programming and integer feasibility
Glover, Fred - In: Operations research 16 (1968) 6, pp. 1212-1216
Persistent link: https://www.econbiz.de/10002452085
Cover Image
Surrogate constraint duality in mathematical programming
Glover, Fred - In: Operations research 23 (1975) 3, pp. 434-451
Persistent link: https://www.econbiz.de/10002452106
Cover Image
Convexity cuts and cut search
Glover, Fred - In: Operations research 21 (1973) 1, pp. 123-134
Persistent link: https://www.econbiz.de/10003561797
Cover Image
Surrogate constraints
Glover, Fred - In: Operations research 16 (1968) 4, pp. 741-749
Persistent link: https://www.econbiz.de/10003561820
Cover Image
Further reduction zero-one polynominal programming problems to zero-one linear programming problems
Glover, Fred; Woolsey, Eugene - In: Operations research 21 (1973) 1, pp. 156-161
Persistent link: https://www.econbiz.de/10003713173
Cover Image
The disjunctive-facet problem: formulation and solution techniques
Glover, F.; Klingman, D.; Stutz, J. - In: Operations research 22 (1974) 3, pp. 582-601
Persistent link: https://www.econbiz.de/10003561788
Cover Image
Further reduction of zero-one polynomial programming problems to zero-one linear programming problems
Glover, Fred; Woolsey, Eugene - In: Operations research 21 (1973) 1, pp. 156-161
Persistent link: https://www.econbiz.de/10002451969