IFORS' Operational Research Hall of Fame

Abstract

International Transactions in Operational ResearchVolume 13, Issue 2 p. 169-174 Free Access IFORS' Operational Research Hall of Fame Egon Balas, Egon BalasSearch for more papers by this author Egon Balas, Egon BalasSearch for more papers by this author First published: 09 March 2006 https://doi.org/10.1111/j.1475-3995.2006.00541.xAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinkedInRedditWechat Selected Original Works Balas, E., 1965. An additive algorithm for solving linear programs with zero–one variables. Operations Research 13, 517– 546. Balas, E., 1969. Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research 17, 941– 957. Balas, E., 1970. Machine sequencing: disjunctive graphs and degree-constrained subgraphs. Naval Research Logistics Quarterly 17, 1– 9. Balas, E., 1974. Disjunctive programming: properties of the convex hull of feasible points. MSRR No. 348, Carnegie Mellon University, July. Also 1998. Discrete Applied Mathematics 89, 1– 44. Balas, E., 1989. The prize collecting traveling salesman problem. Networks 19, 621– 636. Balas, E., 1995. The prize collecting traveling salesman problem: II. Networks 25, 199– 216. Balas, E., Adams, J., Zawack, D., 1988. The shifting bottleneck procedure for job shop scheduling. Management Science 34, 391– 401. Balas, E., Ceria, S., Cornuéjols, G., 1993. A lift-and-project cutting plane algorithm for mixed 0–1 programs. Mathematical Programming 58, 295– 324. Balas, E., Fischetti, M., 1993. A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Mathematical Programming 58, 325– 352. Balas, E., Fischetti, M., 1999. Lifted cycle inequalities for the asymmetric traveling salesman problem. Mathematics of Operations Research 24, 273– 292. Balas, E., Fischetti, M., Pulleyblank, W.R., 1995. The precedence-constrained asymmetric traveling salesman polytope. Mathematical Programming 68, 241– 265. Balas, E., Pulleyblank, W.R., 1983. The perfectly matchable subgraph polytope of a bipartite graph. Networks 13, 495– 516. Balas, E., Vazacopoulos, A., 1998. Guided local search with shifting bottleneck for job shop scheduling. Management Science 44, 262– 275. Biographical Works Balas, E., 2000. Will to Freedom: A Perilous Journey through Fascism and Communism. Syracuse University Press, Syracuse, NY. Balas, E., 2002. Some thoughts on the development of integer programming during my research career. Lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam. European Journal of Operational Research 141, 1– 7. Volume13, Issue2March 2006Pages 169-174 ReferencesRelatedInformation