This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Gerard Cornuéjols | |
|---|---|
| Name | Gerard Cornuéjols |
| Birth date | 1954 |
| Birth place | Charleroi, Belgium |
| Nationality | Belgian-American |
| Fields | Operations Research, Integer Programming, Optimization, Computer Science |
| Workplaces | Carnegie Mellon University, Tepper School of Business, Massachusetts Institute of Technology, Bell Laboratories |
| Alma mater | Université libre de Bruxelles, Carnegie Mellon University |
| Doctoral advisor | Egon Balas |
| Known for | Integer programming, cutting planes, combinatorial optimization |
| Awards | Fulkerson Prize, John von Neumann Theory Prize, INFORMS Fellow |
Gerard Cornuéjols is a Belgian-American mathematician and operations researcher known for foundational contributions to integer programming and combinatorial optimization. He has held faculty positions at Carnegie Mellon University and contributed to research that bridges mathematical programming with practical applications in telecommunications, transportation, and supply chain management. His work on cutting planes, polyhedral combinatorics, and algorithmic complexity has influenced both academic theory and industrial optimization practice.
Cornuéjols was born in Charleroi, Belgium, and completed undergraduate studies at the Université libre de Bruxelles before moving to the United States for graduate study. He earned a Ph.D. in operations research under the supervision of Egon Balas at Carnegie Mellon University, where he joined a community associated with figures such as H. Paul Williams, Ralph Gomory, Jack Edmonds, David Gale, and Michael Trick. His doctoral training connected him to traditions represented by institutions including Bell Labs, Massachusetts Institute of Technology, Princeton University, Stanford University, and University of California, Berkeley.
Cornuéjols has held academic appointments at the Tepper School of Business at Carnegie Mellon University and visiting roles at places such as Massachusetts Institute of Technology. He collaborated with researchers from centers including INFORMS, Mathematical Optimization Society, SIAM, IBM Research, and AT&T Bell Laboratories. His students and collaborators have included scholars associated with Georgia Institute of Technology, Columbia University, University of Pennsylvania, Northwestern University, and University of Michigan. He has lectured at conferences hosted by EuroPT, ICM, SODA, STOC, FOCS, and ICALP.
Cornuéjols made seminal advances in integer programming and the theory of cutting planes, building on work by Gomory, Egon Balas, Jack Edmonds, and Martin Grötschel. He developed classes of cuts such as split cuts, clique cuts, and lift-and-project methods that connect to polyhedral results by Miroslav Fiedler, Claude Berge, and Alexander Schrijver. His research addressed the computational complexity of problems related to the traveling salesman problem, set covering problem, facility location problem, knapsack problem, and graph coloring problem, linking to algorithmic paradigms from Richard Karp, Donald Knuth, Leslie Valiant, and Christos Papadimitriou. Selected publications include monographs and articles that influenced software like CPLEX, Gurobi, SCIP, and solver developments at Google and Microsoft Research. He collaborated with researchers such as Michel Goemans, David Williamson, R. Ravi, A. Schrijver, H. D. Sherali, and W. R. Pulleyblank, and his work connects to duality theory explored by John von Neumann and complexity notions advanced by Stephen Cook and Richard Lipton.
Cornuéjols received major recognitions including the Fulkerson Prize and the John von Neumann Theory Prize, and he is an INFORMS Fellow. His honors associate him with other laureates such as Jack Edmonds, Egon Balas, Martin Grötschel, M. R. Garey, and David S. Johnson. He has been invited to give named lectures alongside speakers from Royal Society, National Academy of Sciences, Académie des Sciences, European Academy of Sciences, and award committees like Guggenheim Fellowship panels. Institutional honors link him to endowed positions and visiting appointments at Princeton University, Harvard University, and Columbia University.
Cornuéjols has served on program committees for conferences such as SODA, STOC, FOCS, ICALP, IPCOPT, and MOPTA, and editorial boards for journals including Mathematical Programming, Operations Research, SIAM Journal on Optimization, Mathematics of Operations Research, and Management Science. He participated in standard-setting and advisory roles for agencies and organizations such as the National Science Foundation, Office of Naval Research, NSERC, EU Horizon 2020, DARPA, and industrial consortia involving Bell Labs and IBM Research. His service extends to mentoring doctoral students who later joined faculties at MIT, Stanford University, Cornell University, Yale University, and University of California, Berkeley.
Cornuéjols holds dual Belgian and American citizenship and maintains ties with academic communities in Belgium and the United States. His legacy is reflected in textbooks, graduate courses, and solver implementations taught at institutions such as ETH Zurich, University of Oxford, Imperial College London, National University of Singapore, and Tsinghua University. Colleagues and students have cited his influence alongside innovators like George Dantzig, Tibor Gallai, Hendrik Lenstra, and László Lovász in shaping contemporary combinatorial optimization and mathematical programming research agendas.
Category:Belgian mathematicians Category:American mathematicians Category:Operations researchers Category:University faculty