World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
66
Citations
19990
World Ranking
356
National Ranking
193

Engineering and Technology

D-Index
66
Citations
20049
World Ranking
1385
National Ranking
458

Research.com Recognitions

  • 2016 - SIAM Fellow For pioneering contributions to integer programming.
  • 2001 - EURO Gold Medal

Overview

Egon Balas was affiliated with Carnegie Mellon University in the United States. Their research primarily focused on fields including Engineering and Computer Science, with significant contributions in subfields such as Industrial and Manufacturing Engineering, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Civil and Structural Engineering, and Computational Mechanics.

The topics covered by their work spanned several areas:

  • Vehicle Routing Optimization Methods
  • Scheduling and Optimization Algorithms
  • Optimization and Packing Problems
  • Formal Methods in Verification
  • Complexity and Algorithms in Graphs
  • Computational Geometry and Mesh Generation
  • Advanced Graph Theory Research

Their publication record featured recent papers on polyhedral disjunctive cuts and lift-and-project cuts, appearing in venues such as Mathematical Programming, arXiv (Cornell University), and the INFORMS Journal on Computing. Notable works included:

  • "$\mathcal{V}$-Polyhedral Disjunctive Cuts," 2022, arXiv (Cornell University)
  • "$$\mathcal {V}$$-polyhedral disjunctive cuts," 2025, Mathematical Programming
  • "When Lift-and-Project Cuts Are Different," 2020, INFORMS Journal on Computing
  • "Monoidal strengthening of simple $\mathcal{V}$-polyhedral disjunctive cuts," 2023, arXiv (Cornell University)
  • "Monoidal strengthening of simple $$\mathcal {V}$$-polyhedral disjunctive cuts," 2025, Mathematical Programming

Frequent co-authors in their work included Aleksandr M. Kazachkov and Thiago Serra, with multiple collaborations particularly with Kazachkov.

Egon Balas published regularly in journals such as Mathematical Programming, arXiv (Cornell University), and the INFORMS Journal on Computing, reflecting a consistent focus on optimization and theoretical aspects of computation.

They were recognized with awards including the SIAM Fellow distinction in 2016 for pioneering contributions to integer programming, and the EURO Gold Medal awarded in 2001.

Best Publications

  • The Shifting Bottleneck Procedure for Job Shop Scheduling

    Joseph Adams;Egon Balas;Daniel Zawack

  • A lift-and-project cutting plane algorithm for mixed 0-1 programs

    Egon Balas;Sebastián Ceria;Gérard Cornuéjols

  • An Additive Algorithm for Solving Linear Programs with Zero-One Variables

    Egon Balas

  • The Prize collecting traveling salesman problem

    Egon Balas

  • An Algorithm for Large Zero-One Knapsack Problems

    Egon Balas;Eitan Zemel

  • Set Partitioning: A survey

    Egon Balas;Manfred W. Padberg

  • Disjunctive programming and a hierarchy of relaxations for discrete optimization problems

    Egon Balas

  • Disjunctive programming: properties of the convex hull of feasible points

    Egon Balas

  • Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

    Egon Balas;Alkis Vazacopoulos

  • Facets of the knapsack polytope

    Egon Balas

  • Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

    Egon Balas

  • Intersection Cuts—A New Type of Cutting Planes for Integer Programming

    Egon Balas

  • Finding a maximum clique in an arbitrary graph

    Egon Balas;Chang Sung Yu

  • Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

    Egon Balas;Andrew Ho

  • Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

    Egon Balas;Sebastián Ceria;Gérard Cornuéjols

  • Gomory cuts revisited

    E. Balas;S. Ceria;G. Cornuéjols;N. Natraj

  • Branch and Bound Methods for the Traveling Salesman Problem

    Egon Balas;Paolo Toth

  • Pivot and Complement–A Heuristic for 0-1 Programming

    Egon Balas;Clarence H. Martin

  • Canonical Cuts on the Unit Hypercube

    Egon Balas;Robert Jeroslow

  • Facets of the Knapsack Polytope From Minimal Covers

    Egon Balas;Eitan Zemel

Frequent Co-Authors

Matteo Fischetti
Matteo Fischetti University of Padua
Gérard Cornuéjols
Gérard Cornuéjols Carnegie Mellon University
Manfred Padberg
Manfred Padberg New York University
Jan Karel Lenstra
Jan Karel Lenstra Centrum Wiskunde & Informatica
William R. Pulleyblank
William R. Pulleyblank United States Military Academy
Paolo Toth
Paolo Toth University of Bologna
Michael J. Todd
Michael J. Todd Cornell University
Fred Glover
Fred Glover University of Colorado Boulder
Joseph F. Pekny
Joseph F. Pekny Purdue University West Lafayette
Laurence A. Wolsey
Laurence A. Wolsey Université Catholique de Louvain

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics, exploring related online degrees can open up diverse career opportunities. Data-driven fields are growing rapidly, making data analysis programs a natural extension for math graduates. These programs build on mathematical foundations to develop skills in interpreting complex datasets and informing decision-making.

Many professionals also seek to strengthen their leadership and business acumen through management degrees. The easiest mba specialization options provide accessible pathways for those balancing work and study, making the transition smoother without compromising on career advancement.

With remote learning on the rise, pursuing the easiest online mba is an attractive alternative for math professionals aiming for executive roles. These programs offer flexibility while still delivering core business skills tailored to different industries.

For those interested in executive-level research and teaching positions, dba online programs provide an affordable way to earn a Doctorate in Business Administration. This advanced degree complements mathematical expertise with strategic business knowledge, enhancing career prospects across academia and industry.

Best Scientists Citing Egon Balas