Egon Balas
According to our database^{1},
Egon Balas
authored at least 98 papers
between 1966 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on id.loc.gov

on dnb.info

on isni.org
On csauthors.net:
Bibliography
2020
Math. Program. Comput., 2020
INFORMS J. Comput., 2020
2016
On the relationship between standard intersection cuts, liftandproject cuts, and generalized intersection cuts.
Math. Program., 2016
2015
Discret. Optim., 2015
2013
Math. Program., 2013
INFORMS J. Comput., 2013
EURO J. Comput. Optim., 2013
2012
Math. Program., 2012
Discret. Optim., 2012
2011
Math. Program., 2011
Ann. Oper. Res., 2011
2010
Math. Program., 2010
Proceedings of the 50 Years of Integer Programming 19582008, 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Networks, 2009
Generating liftandproject cuts from the LP simplex tableau: open source implementation and testing of new variants.
Math. Program. Comput., 2009
2008
J. Sched., 2008
Math. Program., 2008
Discret. Optim., 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2007
Some thoughts on the development of integer programming during my research career.
Ann. Oper. Res., 2007
New Variants of LiftandProject Cut Generation from the LP Tableau: Open Source Implementation and Testing.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
2006
Int. Trans. Oper. Res., 2006
Discret. Optim., 2006
2005
Math. Program., 2005
Math. Program., 2005
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization.
Ann. Oper. Res., 2005
2004
Math. Program., 2004
J. Comb. Optim., 2004
Discret. Optim., 2004
2003
A precise correspondence between liftandproject cuts, simple disjunctive cuts, and mixed integer gomory cuts for 01 programming.
Math. Program., 2003
2002
"Some thoughts on the development of integer programming during my research careerlecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam": [European Journal of Operational Research 141 (1) (2002) 17].
Eur. J. Oper. Res., 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.
Eur. J. Oper. Res., 2002
Discret. Appl. Math., 2002
2001
Oper. Res., 2001
Linear Time DynamicProgramming Algorithms for New Classes of Restricted TSPs: A Computational Study.
INFORMS J. Comput., 2001
Proceedings of the Integer Programming and Combinatorial Optimization, 2001
Proceedings of the Computational Combinatorial Optimization, 2001
2000
Networks, 2000
1999
Math. Oper. Res., 1999
1998
J. Comb. Optim., 1998
Optimized CrossoverBased Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems.
J. Heuristics, 1998
Discret. Appl. Math., 1998
Discret. Appl. Math., 1998
Comput. Optim. Appl., 1998
1997
Math. Program., 1997
Math. Program., 1997
1996
Oper. Res. Lett., 1996
Oper. Res., 1996
Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring.
Algorithmica, 1996
Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
Networks, 1995
Math. Program., 1995
1993
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets.
Math. Program., 1993
Math. Program., 1993
Discret. Appl. Math., 1993
Proceedings of the Fourth Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1993
Proceedings of the Cliques, 1993
Proceedings of the Cliques, 1993
1992
Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs.
SIAM J. Comput., 1992
Math. Oper. Res., 1992
1991
Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs.
SIAM J. Comput., 1991
J. ACM, 1991
Oper. Res., 1991
1990
Finding Out Whether a Valid Inequality is Facet Defining.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990
1989
The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph.
SIAM J. Discret. Math., 1989
Networks, 1989
Networks, 1989
Math. Program., 1989
Math. Program., 1989
On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}.
Math. Program., 1989
Discret. Appl. Math., 1989
Comb., 1989
1987
Math. Oper. Res., 1987
1986
SIAM J. Comput., 1986
A fast algorithm for finding an edgemaximal subgraph with a TRformative coloring.
Discret. Appl. Math., 1986
1984
Math. Program., 1984
Math. Program., 1984
Math. Oper. Res., 1984
1983
Networks, 1983
1981
Math. Program., 1981
1980
Oper. Res., 1980
1977
Networks, 1977
Math. Oper. Res., 1977
1975
Math. Program., 1975
Oper. Res., 1975
1973
Technical Note  A Note on the Group Theoretic Approach to Integer Programming and the 01 Case.
Oper. Res., 1973
1972
Math. Program., 1972
Oper. Res., 1972
Discret. Math., 1972
1971
Oper. Res., 1971
Oper. Res., 1971
1969
Oper. Res., 1969
1968
Oper. Res., 1968
Oper. Res., 1968
1967
Oper. Res., 1967
1966
Oper. Res., 1966
Oper. Res., 1966