default search action
Egon Balas
Person information
- affiliation: Carnegie Mellon University, Tepper School of Business, Pittsburgh, USA
- award (1995): John von Neumann Theory Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [c12]Aleksandr M. Kazachkov
, Egon Balas:
Monoidal Strengthening of Simple V-Polyhedral Disjunctive Cuts. IPCO 2023: 275-290 - 2020
- [j89]Egon Balas, Thiago Serra
When Lift-and-Project Cuts Are Different. INFORMS J. Comput. 32(3): 822-834 (2020) - [j88]Aleksandr M. Kazachkov
Partial hyperplane activation for generalized intersection cuts. Math. Program. Comput. 12(1): 69-107 (2020)
2010 – 2019
- 2018
- [i2]Egon Balas, Thiago Serra:
When Lift-and-Project Cuts are Different. CoRR abs/1809.05794 (2018) - 2016
- [j87]Egon Balas, Tamás Kis
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts. Math. Program. 160(1-2): 85-114 (2016) - 2015
- [j86]Egon Balas, Tamás Kis
Intersection cuts - standard versus restricted. Discret. Optim. 18: 189-192 (2015) - 2013
- [j85]Egon Balas, Andrea Qualizza:
Intersection cuts from multiple rows: a disjunctive programming approach. EURO J. Comput. Optim. 1(1-2): 3-49 (2013) - [j84]Egon Balas, Gérard Cornuéjols, Tamás Kis
Combining Lift-and-Project and Reduce-and-Split. INFORMS J. Comput. 25(3): 475-487 (2013) - [j83]Egon Balas, François Margot:
Generalized intersection cuts and a new cut generating paradigm. Math. Program. 137(1-2): 19-35 (2013) - 2012
- [j82]Egon Balas, Andrea Qualizza:
Monoidal cut strengthening revisited. Discret. Optim. 9(1): 40-49 (2012) - [j81]Egon Balas, Matteo Fischetti, Arrigo Zanette:
A hard integer program made easy by lexicography. Math. Program. 135(1-2): 509-514 (2012) - [i1]Egon Balas, Andrea Qualizza:
Intersection cuts from multiple rows: a disjunctive programming approach. CoRR abs/1206.1630 (2012) - 2011
- [j80]Egon Balas:
Projecting systems of linear inequalities with binary variables. Ann. Oper. Res. 188(1): 19-31 (2011) - [j79]Arrigo Zanette, Matteo Fischetti, Egon Balas:
Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. 130(1): 153-176 (2011) - 2010
- [j78]Egon Balas, Matteo Fischetti, Arrigo Zanette:
On the enumerative nature of Gomory's dual cutting plane method. Math. Program. 125(2): 325-351 (2010) - [p1]Egon Balas:
Disjunctive Programming. 50 Years of Integer Programming 2010: 283-340
2000 – 2009
- 2009
- [j77]Egon Balas, Pierre Bonami:
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Math. Program. Comput. 1(2-3): 165-199 (2009) - [j76]Egon Balas, Rüdiger Stephan:
On the cycle polytope of a directed graph and its relaxations. Networks 54(1): 47-55 (2009) - [r1]Egon Balas:
Integer Programming. Encyclopedia of Optimization 2009: 1617-1624 - 2008
- [j75]Egon Balas, Alan J. Hoffman, S. Thomas McCormick:
A Special Issue in Memory of George B. Dantzig. Discret. Optim. 5(2): 145-150 (2008) - [j74]Egon Balas, Anureet Saxena:
Optimizing over the split closure. Math. Program. 113(2): 219-240 (2008) - [j73]Egon Balas, Neil Simonetti
Job shop scheduling with setup times, deadlines and precedence constraints. J. Sched. 11(4): 253-262 (2008) - [c11]Arrigo Zanette, Matteo Fischetti, Egon Balas:
Can Pure Cutting Plane Algorithms Work?. IPCO 2008: 416-434 - 2007
- [j72]Egon Balas:
Some thoughts on the development of integer programming during my research career. Ann. Oper. Res. 149(1): 19-26 (2007) - [c10]Egon Balas, Pierre Bonami:
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing. IPCO 2007: 89-103 - 2006
- [j71]Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti
New facets of the STS polytope generated from known facets of the ATS polytope. Discret. Optim. 3(1): 3-19 (2006) - [j70]Egon Balas:
IFORS' Operational Research Hall of Fame. Int. Trans. Oper. Res. 13(2): 169-174 (2006) - [c9]Egon Balas, Rüdiger Stephan:
On the Cycle Polytope of a Directed Graph and Its Relaxations. OR 2006: 203-208 - 2005
- [j69]Egon Balas:
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization. Ann. Oper. Res. 140(1): 125-161 (2005) - [j68]Egon Balas, Cid C. de Souza
The vertex separator problem: a polyhedral investigation. Math. Program. 103(3): 583-608 (2005) - [j67]Cid C. de Souza
The vertex separator problem: algorithms and computations. Math. Program. 103(3): 609-631 (2005) - 2004
- [j66]Egon Balas, Stefan Schmieta, Christopher Wallace:
Pivot and shift - a mixed integer programming heuristic. Discret. Optim. 1(1): 3-12 (2004) - [j65]Egon Balas:
Logical Constraints as Cardinality Rules: Tight Representation. J. Comb. Optim. 8(2): 115-128 (2004) - [j64]Egon Balas, Alexander Bockmayr
On unions and dominants of polytopes. Math. Program. 99(2): 223-239 (2004) - 2003
- [j63]Egon Balas, Michael Perregaard:
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming. Math. Program. 94(2-3): 221-245 (2003) - 2002
- [j62]Egon Balas, Michael Perregaard:
Lift-and-project for Mixed 0-1 programming: recent progress. Discret. Appl. Math. 123(1-3): 129-154 (2002) - [j61]Egon Balas:
Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam. Eur. J. Oper. Res. 141(1): 1-7 (2002) - [j60]Egon Balas:
"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) (2002) 1-7]. Eur. J. Oper. Res. 143(3): 644 (2002) - 2001
- [j59]Egon Balas, Neil Simonetti
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study. INFORMS J. Comput. 13(1): 56-75 (2001) - [j58]Egon Balas, Sebastián Ceria, Milind Dawande
Octane: A New Heuristic for Pure 0-1 Programs. Oper. Res. 49(2): 207-225 (2001) - [c8]Egon Balas:
Projection and Lifting in Combinatorial Optimization. Computational Combinatorial Optimization 2001: 26-56 - [c7]Michael Perregaard, Egon Balas:
Generating Cuts from Multiple-Term Disjunctions. IPCO 2001: 348-360 - 2000
- [j57]Egon Balas, Maarten Oosten:
On the cycle polytope of a directed graph. Networks 36(1): 34-46 (2000)
1990 – 1999
- 1999
- [j56]Egon Balas:
New classes of efficiently solvable generalized Traveling Salesman Problems. Ann. Oper. Res. 86: 529-558 (1999) - [j55]Egon Balas, Matteo Fischetti:
Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem. Math. Oper. Res. 24(2): 273-292 (1999) - 1998
- [j54]Egon Balas:
Projection with a Minimal System of Inequalities. Comput. Optim. Appl. 10(2): 189-193 (1998) - [j53]Egon Balas, Maarten Oosten:
On the Dimension of Projected Polyhedra. Discret. Appl. Math. 87(1-3): 1-9 (1998) - [j52]Egon Balas:
Disjunctive Programming: Properties of the Convex Hull of Feasible Points. Discret. Appl. Math. 89(1-3): 3-44 (1998) - [j51]Egon Balas, William Niehaus:
Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems. J. Heuristics 4(2): 107-122 (1998) - [j50]Egon Balas, Giuseppe Lancia
Job Shop Scheduling With Deadlines. J. Comb. Optim. 1(4): 329-353 (1998) - 1997
- [j49]Egon Balas, Matteo Fischetti:
On the monotonization of polyhedra. Math. Program. 77: 59-84 (1997) - [j48]Egon Balas:
A modified lift-and-project procedure. Math. Program. 79: 19-31 (1997) - 1996
- [j47]Egon Balas, Jue Xue:
Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring. Algorithmica 15(5): 397-412 (1996) - [j46]Egon Balas, Maria C. Carrera:
A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering. Oper. Res. 44(6): 875-890 (1996) - [j45]Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj:
Gomory cuts revisited. Oper. Res. Lett. 19(1): 1-9 (1996) - [c6]Neil Simonetti
Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems. IPCO 1996: 316-329 - 1995
- [j44]Egon Balas, Matteo Fischetti, William R. Pulleyblank:
The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68: 241-265 (1995) - [j43]Egon Balas:
The prize collecting traveling salesman problem: II. Polyhedral results. Networks 25(4): 199-216 (1995) - [e2]Egon Balas, Jens Clausen:
Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings. Lecture Notes in Computer Science 920, Springer 1995, ISBN 3-540-59408-6 [contents] - 1993
- [j42]Egon Balas, Liqun Qi
Linear-Time Separation Algorithms for the Three-Index Assignment Polytope. Discret. Appl. Math. 43(1): 1-12 (1993) - [j41]Egon Balas, Sebastián Ceria, Gérard Cornuéjols:
A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58: 295-324 (1993) - [j40]Egon Balas, Matteo Fischetti:
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Math. Program. 58: 325-352 (1993) - [c5]Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki:
Polyhedral methods for the maximum clique problem. Cliques, Coloring, and Satisfiability 1993: 11-28 - [c4]Egon Balas, William Niehaus:
Finding large cliques in arbitrary graphs by bipartite matching. Cliques, Coloring, and Satisfiability 1993: 29-51 - [c3]Egon Balas, Matteo Fischetti:
On the monotonization of polyhedra. IPCO 1993: 23-38 - [c2]Egon Balas, Sebastián Ceria, Gérard Cornuéjols:
Solving Mixed 0-1 Programs by a Lift-and-Project Method. SODA 1993: 232-242 - 1992
- [j39]Egon Balas, Matteo Fischetti:
The Fixed-Outdegree 1-Arborescence Polytope. Math. Oper. Res. 17(4): 1001-1018 (1992) - [j38]Egon Balas, Jue Xue:
Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. SIAM J. Comput. 21(5): 1000 (1992) - [e1]Egon Balas, Gérard Cornuéjols, Ravi Kannan:
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992. Carnegie Mellon University 1992 [contents] - 1991
- [j37]Egon Balas, Matthew J. Saltzman:
An Algorithm for the Three-Index Assignment Problem. Oper. Res. 39(1): 150-161 (1991) - [j36]Egon Balas, Donald L. Miller, Joseph F. Pekny, Paolo Toth:
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem. J. ACM 38(4): 985-1004 (1991) - [j35]Egon Balas, Jue Xue:
Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. SIAM J. Comput. 20(2): 209-221 (1991) - 1990
- [c1]Egon Balas:
Finding Out Whether a Valid Inequality is Facet Defining. IPCO 1990: 45-59
1980 – 1989
- 1989
- [j34]Egon Balas, William R. Pulleyblank:
The perfectly matchable subgraph polytope of an arbitrary graph. Comb. 9(4): 321-337 (1989) - [j33]Egon Balas, Matthew J. Saltzman:
Facets of the three-index assignment polytope. Discret. Appl. Math. 23(3): 201-229 (1989) - [j32]Egon Balas, Shu Ming Ng:
On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}. Math. Program. 43(1-3): 57-69 (1989) - [j31]Egon Balas, Joseph M. Tama, Jørgen Tind:
Sequential convexification in reverse convex and disjunctive programming. Math. Program. 44(1-3): 337-350 (1989) - [j30]Egon Balas, Shu Ming Ng:
On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}. Math. Program. 45(1-3): 1-20 (1989) - [j29]Egon Balas, Chang Sung Yu:
On graphs with polynomially solvable maximum-weight clique problem. Networks 19(2): 247-253 (1989) - [j28]Egon Balas:
The prize collecting traveling salesman problem. Networks 19(6): 621-636 (1989) - [j27]Egon Balas:
The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph. SIAM J. Discret. Math. 2(4): 425-451 (1989) - 1987
- [j26]Egon Balas, Vasek Chvátal, Jaroslav Nesetril:
On the Maximum Weight Clique Problem. Math. Oper. Res. 12(3): 522-535 (1987) - 1986
- [j25]Egon Balas:
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Discret. Appl. Math. 15(2-3): 123-134 (1986) - [j24]Egon Balas, Chang Sung Yu:
Finding a Maximum Clique in an Arbitrary Graph. SIAM J. Comput. 15(4): 1054-1068 (1986) - 1984
- [j23]Egon Balas:
A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers. Math. Oper. Res. 9(1): 1-5 (1984) - [j22]Egon Balas, Joseph B. Mazzola:
Nonlinear 0-1 programming: I. Linearization techniques. Math. Program. 30(1): 1-21 (1984) - [j21]Egon Balas, Joseph B. Mazzola:
Nonlinear 0-1 programming: II. Dominance relations and algorithms. Math. Program. 30(1): 22-45 (1984) - 1983
- [j20]Egon Balas:
Disjunctive programming: To: E. Balas in: P.L. Hammer, E.L. Johnson and B.H. Korete, eds., Discrete Optimization II, Ann. Discrete Math 5 (North-Holland, Amsterdam, 1979) 3-51. Discret. Appl. Math. 5(2): 247-248 (1983) - [j19]Egon Balas, William R. Pulleyblank:
The perfectly matchable subgraph polytope of a bipartite graph. Networks 13(4): 495-516 (1983) - 1981
- [j18]Egon Balas, Nicos Christofides:
A restricted Lagrangean approach to the traveling salesman problem. Math. Program. 21(1): 19-46 (1981) - 1980
- [j17]Egon Balas, Eitan Zemel:
An Algorithm for Large Zero-One Knapsack Problems. Oper. Res. 28(5): 1130-1154 (1980)
1970 – 1979
- 1977
- [j16]Egon Balas, Eitan Zemel:
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes. Math. Oper. Res. 2(1): 15-19 (1977) - [j15]Egon Balas, Eitan Zemel:
Graph substitution and set packing polytopes. Networks 7(3): 267-284 (1977) - 1975
- [j14]Egon Balas, Manfred Padberg:
On the Set-Covering Problem: II. An Algorithm for Set Partitioning. Oper. Res. 23(1): 74-90 (1975) - [j13]Egon Balas:
Facets of the knapsack polytope. Math. Program. 8(1): 146-164 (1975) - 1973
- [j12]Egon Balas:
Technical Note - A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case. Oper. Res. 21(1): 321-322 (1973) - 1972
- [j11]Egon Balas:
Ranking the facets of the octahedron. Discret. Math. 2(1): 1-15 (1972) - [j10]Egon Balas, Manfred W. Padberg:
On the Set-Covering Problem. Oper. Res. 20(6): 1152-1161 (1972) - [j9]Egon Balas:
Integer programming and convex analysis: Intersection cuts from outer polars. Math. Program. 2(1): 330-382 (1972) - 1971
- [j8]Egon Balas:
Intersection Cuts - A New Type of Cutting Planes for Integer Programming. Oper. Res. 19(1): 19-39 (1971) - [j7]Egon Balas, V. Joseph Bowman, Fred W. Glover, David Sommer:
An Intersection Cut from the Dual of the Unit Hypercube. Oper. Res. 19(1): 40-44 (1971)
1960 – 1969
- 1969
- [j6]Egon Balas:
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm. Oper. Res. 17(6): 941-957 (1969) - 1968
- [j5]Egon Balas:
Letter to the Editor - A Note on the Branch-and-Bound Principle. Oper. Res. 16(2): 442-445 (1968) - [j4]Egon Balas:
Errata. Oper. Res. 16(4): 886 (1968) - 1967
- [j3]Egon Balas:
Discrete Programming by the Filter Method. Oper. Res. 15(5): 915-957 (1967) - 1966
- [j2]Egon Balas:
An Infeasibility-Pricing Decomposition Method for Linear Programs. Oper. Res. 14(5): 847-873 (1966) - [j1]Egon Balas:
Letter to the Editor - Comments on the Preceding Note. Oper. Res. 14(5): 942 (1966)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: