Egon Balas

发表

On the Set-Covering Problem: II. An Algorithm for Set Partitioning

Egon Balas, Manfred W. Padberg, E. Balas, 1972, Oper. Res..

Letter to the Editor - A Note on the Branch-and-Bound Principle

Egon Balas, E. Balas, 1968, Oper. Res..

Sequential convexification in reverse convex and disjunctive programming

Egon Balas, Joseph M. Tama, Jørgen Tind, 1989, Math. Program..

On the monotonization of polyhedra

Egon Balas, Matteo Fischetti, E. Balas, 1997, Math. Program..

Nonlinear 0–1 programming: I. Linearization techniques

Egon Balas, Joseph B. Mazzola, E. Balas, 1984, Math. Program..

New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing

Egon Balas, Pierre Bonami, 2007, IPCO.

Job shop scheduling with setup times, deadlines and precedence constraints

Egon Balas, Neil Simonetti, Alkis Vazacopoulos, 2008, J. Sched..

New facets of the STS polytope generated from known facets of the ATS polytope

Egon Balas, Matteo Fischetti, Neil Simonetti, 2006, Discret. Optim..

On the cycle polytope of a directed graph

Egon Balas, Maarten Oosten, 2000, Networks.

A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring

Egon Balas, 1986, Discret. Appl. Math..

Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring

Egon Balas, Jue Xue, E. Balas, 1996, Algorithmica.

An Infeasibility-Pricing Decomposition Method for Linear Programs

Egon Balas, E. Balas, 1966, Oper. Res..

Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems

Egon Balas, Neil Simonetti, 1996, IPCO.

The Fixed-Outdegree 1-Arborescence Polytope

Egon Balas, Matteo Fischetti, 1992, Math. Oper. Res..

Intersection cuts from multiple rows: a disjunctive programming approach

Egon Balas, Andrea Qualizza, E. Balas, 2012, EURO J. Comput. Optim..

Logical Constraints as Cardinality Rules: Tight Representation

Egon Balas, 2004, J. Comb. Optim..

The vertex separator problem: a polyhedral investigation

Egon Balas, Cid C. de Souza, E. Balas, 2005, Math. Program..

On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}

Egon Balas, Shu Ming Ng, E. Balas, 1986, Math. Program..

The perfectly matchable subgraph polytope of a bipartite graph

Egon Balas, William R. Pulleyblank, E. Balas, 1983, Networks.

Disjunctive Cuts from the V -Polyhedral Representation

Egon Balas, 2018 .

Solving mixed 0-1programs by a lift-and-project method

Egon Balas, Gérard Cornuéjols, Sebastián Ceria, 1993, SODA '93.

Errata

Egon Balas, 1968, Oper. Res..

Linear-Time Separation Algorithms for the Three-Index Assignment Polytope

Egon Balas, Liqun Qi, E. Balas, 1993, Discret. Appl. Math..

On the Dimension of Projected Polyhedra

Egon Balas, Maarten Oosten, 1998, Discret. Appl. Math..

Job Shop Scheduling With Deadlines

Egon Balas, Giuseppe Lancia, Paolo Serafini, 1998, J. Comb. Optim..

On unions and dominants of polytopes

Egon Balas, Laurence A. Wolsey, Alexander Bockmayr, 2004, Math. Program..

Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants

Egon Balas, Pierre Bonami, E. Balas, 2009, Math. Program. Comput..

A parallel shortest augmenting path algorithm for the assignment problem

Egon Balas, Paolo Toth, Joseph F. Pekny, 1991, JACM.

Polyhedral Theory for the Asymmetric Traveling Salesman Problem

Egon Balas, Matteo Fischetti, E. Balas, 2007 .

Ranking the facets of the octahedron

Egon Balas, 1972, Discret. Math..

Integer programming and convex analysis: Intersection cuts from outer polars

Egon Balas, E. Balas, 1972, Math. Program..

Disjunctive Programming

Egon Balas, 2010, 50 Years of Integer Programming.

Implementation and Testing of Variants

Egon Balas, 2018 .

On the Maximum Weight Clique Problem

Egon Balas, Jaroslav Nesetril, Vasek Chvátal, 1987, Math. Oper. Res..

Combining Lift-and-Project and Reduce-and-Split

Egon Balas, Gérard Cornuéjols, Giacomo Nannicini, 2013, INFORMS J. Comput..

Polyhedral methods for the maximum clique problem

Egon Balas, Gérard Cornuéjols, Gábor Pataki, 1994, Cliques, Coloring, and Satisfiability.

A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM

Egon Balas, Paolo Toth, Joseph F. Pekny, 1989 .

A hard integer program made easy by lexicography

Egon Balas, Matteo Fischetti, Arrigo Zanette, 2012, Math. Program..

The Shifting Bottleneck Procedure for Job Shop Scheduling

Egon Balas, Joseph Adams, Daniel Zawack, 1988 .

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

Egon Balas, Gérard Cornuéjols, Sebastián Ceria, 1993, Math. Program..

The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph

Egon Balas, 1989, SIAM J. Discret. Math..

Design of maximum-cardinality and maximum-weight clique heuristics with applications

Egon Balas, William Niehaus, 1996 .

Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs

Egon Balas, Jue Xue, E. Balas, 1991, SIAM J. Comput..

Gomory cuts revisited

Egon Balas, Gérard Cornuéjols, Sebastián Ceria, 1996, Oper. Res. Lett..

Nonlinear 0–1 programming: II. Dominance relations and algorithms

Egon Balas, Joseph B. Mazzola, E. Balas, 1983, Math. Program..

Intersection Cuts - A New Type of Cutting Planes for Integer Programming

Egon Balas, E. Balas, 1971, Oper. Res..

Generalized intersection cuts and a new cut generating paradigm

Egon Balas, François Margot, E. Balas, 2013, Math. Program..

On the enumerative nature of Gomory’s dual cutting plane method

Egon Balas, Matteo Fischetti, Arrigo Zanette, 2010, Math. Program..

The prize collecting traveling salesman problem: II. Polyhedral results

Egon Balas, E. Balas, 1995, Networks.

Octane: A New Heuristic for Pure 0-1 Programs

Egon Balas, Milind Dawande, Gábor Pataki, 2001, Oper. Res..

A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets

Egon Balas, Matteo Fischetti, E. Balas, 1993, Math. Program..

A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming

Egon Balas, Michael Perregaard, E. Balas, 2003, Math. Program..

Implicit Enumeration: An Introductory Survey.

Egon Balas, 1973 .

Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes

Egon Balas, Eitan Zemel, 1977, Math. Oper. Res..

Lift-and-Project Cuts for Mixed 0-1 Programs

Egon Balas, 2018 .

Disjunctive Programming and Extended Formulations

Egon Balas, 2018 .

Projecting systems of linear inequalities with binary variables

Egon Balas, 2011, Ann. Oper. Res..

A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers

Egon Balas, 1984, Math. Oper. Res..

A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering

Egon Balas, Maria C. Carrera, E. Balas, 1992, Oper. Res..

Some thoughts on the development of integer programming during my research career

Egon Balas, 2007, Ann. Oper. Res..

The perfectly Matchable Subgraph Polytope of an arbitrary graph

Egon Balas, William R. Pulleyblank, 1989, Comb..

Facets of the knapsack polytope

Egon Balas, E. Balas, 1975, Math. Program..

An Intersection Cut from the Dual of the Unit Hypercube

Egon Balas, Fred W. Glover, David Sommer, 1971, Oper. Res..

Unions of Polytopes in Different Spaces

Egon Balas, 2018 .

On the Set-Covering Problem

Egon Balas, Manfred W. Padberg, E. Balas, 1972, Oper. Res..

On the cycle polytope of a directed graph and its relaxations

Egon Balas, Rüdiger Stephan, 2009, Networks.

Projection with a Minimal System of Inequalities

Egon Balas, 1998, Comput. Optim. Appl..

One Machine Scheduling With Delayed Precedence Constraints.

Egon Balas, Jan Karel Lenstra, Alkis Vazacopoulos, 1993 .

The Prize Collecting Traveling Salesman Problem and its Applications

Egon Balas, 2007 .

IFORS' Operational Research Hall of Fame

Egon Balas, 2006, Int. Trans. Oper. Res..

Projection and Lifting in Combinatorial Optimization

Egon Balas, 2001, Computational Combinatorial Optimization.

Discrete Programming by the Filter Method

Egon Balas, E. Balas, 1967, Oper. Res..

PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS.

Egon Balas, E. Balas, 1968 .

A modified lift-and-project procedure

Egon Balas, 1997, Math. Program..

Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems

Egon Balas, William Niehaus, E. Balas, 1998, J. Heuristics.

Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study

Egon Balas, Neil Simonetti, E. Balas, 2000, INFORMS J. Comput..

Finding a Maximum Clique in an Arbitrary Graph

Egon Balas, Chang Sung Yu, E. Balas, 1986, SIAM J. Comput..

Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam

Egon Balas, 2002, Eur. J. Oper. Res..

The precedence-constrained asymmetric traveling salesman polytope

Egon Balas, Matteo Fischetti, William R. Pulleyblank, 1995, Math. Program..

Traffic assignment in communication satellites

Egon Balas, Philip R. Landweer, E. Balas, 1983 .

Error Noted in a Paper by Jacobs, Silan, and Clemson

Egon Balas, Michael J. Todd, Eitan Zemel, 1998 .

programming: Properties of the convex hull of feasible points *

Egon Balas, E. Balas, 1998 .

Integer Programming

Egon Balas, E. Balas, 2021, Encyclopedia of Optimization.

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

Egon Balas, E. Balas, 1969, Oper. Res..

Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs

Egon Balas, Jue Xue, E. Balas, 1992, SIAM J. Comput..

Finding Out Whether a Valid Inequality is Facet Defining

Egon Balas, 1990, IPCO.

Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization

Egon Balas, E. Balas, 2005, Ann. Oper. Res..

The prize collecting traveling salesman problem

Egon Balas, E. Balas, 1989, Networks.

Integer Programming and Combinatorial Optimization

Egon Balas, Jens Clausen, 1995, Lecture Notes in Computer Science.

Monoidal cut strengthening revisited

Egon Balas, Andrea Qualizza, 2012, Discret. Optim..

Robert G. Jeroslow 1942–1988

Egon Balas, 2005, Annals of Mathematics and Artificial Intelligence.

A restricted Lagrangean approach to the traveling salesman problem

Egon Balas, Nicos Christofides, E. Balas, 1981, Math. Program..

Letter to the Editor - Comments on the Preceding Note

Egon Balas, 1966, Oper. Res..

Technical Note - A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case

Egon Balas, 1973, Oper. Res..

Lexicography and degeneracy: can a pure cutting plane algorithm work?

Egon Balas, Matteo Fischetti, Arrigo Zanette, 2011, Math. Program..

Lift-and-project for Mixed 0-1 programming: recent progress

Egon Balas, Michael Perregaard, E. Balas, 2002, Discret. Appl. Math..

Report of the Session on: Branch and Bound/Implicit Enumeration

Egon Balas, M. Guignard, 1979 .

Can Pure Cutting Plane Algorithms Work?

Egon Balas, Matteo Fischetti, Arrigo Zanette, 2008, IPCO.

Optimizing over the split closure

Egon Balas, Anureet Saxena, E. Balas, 2008, Math. Program..

Partial hyperplane activation for generalized intersection cuts

Egon Balas, Selvaprabu Nadarajah, Aleksandr M. Kazachkov, 2017, Math. Program. Comput..

On the Cycle Polytope of a Directed Graph and Its Relaxations

Egon Balas, Rüdiger Stephan, 2006, OR.

Parallel shortest augmenting path algorithm for the assignment problem. Technical report

Egon Balas, Paolo Toth, Joseph F. Pekny, 1989 .

Intersection cuts - standard versus restricted

Egon Balas, Tamás Kis, 2015, Discret. Optim..

An Algorithm for Large Zero-One Knapsack Problems

Egon Balas, Eitan Zemel, E. Balas, 1980, Oper. Res..

"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]

Egon Balas, 2002, Eur. J. Oper. Res..

Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Egon Balas, Alkis Vazacopoulos, E. Balas, 1998 .

The vertex separator problem: algorithms and computations

Egon Balas, Cid C. de Souza, 2005, Math. Program..

Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem

Egon Balas, Matteo Fischetti, E. Balas, 1999, Math. Oper. Res..

Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization

Egon Balas, Jens Clausen, 1995 .

Generating Cuts from Multiple-Term Disjunctions

Egon Balas, Michael Perregaard, E. Balas, 2001, IPCO.

Finding large cliques in arbitrary graphs by bipartite matching

Egon Balas, William Niehaus, E. Balas, 1993, Cliques, Coloring, and Satisfiability.

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992

Egon Balas, Gérard Cornuéjols, Ravi Kannan, 1992, IPCO.

On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts

Egon Balas, Tamás Kis, 2016, Math. Program..

A Special Issue in Memory of George B. Dantzig

Egon Balas, S. Thomas McCormick, Alan J. Hoffman, 2008, Discret. Optim..

Facets of the three-index assignment polytope

Egon Balas, Matthew J. Saltzman, E. Balas, 1989, Discret. Appl. Math..

On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}

Egon Balas, Shu Ming Ng, E. Balas, 1989, Math. Program..

Graph substitution and set packing polytopes

Egon Balas, Eitan Zemel, E. Balas, 1977, Networks.

An Algorithm for the Three-Index Assignment Problem

Egon Balas, Matthew J. Saltzman, E. Balas, 1991, Oper. Res..

When Lift-and-Project Cuts are Different

Egon Balas, Thiago Serra, 2020, INFORMS J. Comput..

On graphs with polynomially solvable maximum-weight clique problem

Egon Balas, Chang Sung Yu, E. Balas, 1989, Networks.

A note on duality in disjunctive programming

Egon Balas, 1977 .

On the convex hull of the union of certain polyhedra

Egon Balas, 1988 .

All the Facets of Zero-One Programming Polytopes with Positive Coefficients.

Egon Balas, Eitan Zemel, 1975 .

Intersection cuts from outer polars of truncated cubes

Egon Balas, Andris A. Zoltners, 1975 .

A Note on the Asymptotic Theory of Integer Programming and the 0-1 Case.

Egon Balas, E. Balas, 1971 .

On the cycle polytope of a directed graph

Egon Balas, Maarten Oosten, 2000 .

Set Covering with Cutting Planes from Conditional Bounds.

Egon Balas, E. Balas, 1977 .

DUALITY IN DISCRETE PROGRAMMING

Egon Balas, 1967 .

A node covering algorithm

Egon Balas, Haakon Samuelsson, 1977 .

The Assignable Subgraph Polytope of a Directed Graph.

Egon Balas, 1987 .

DUALITY IN DISCRETE PROGRAMMING: IV. APPLICATIONS.

Egon Balas, 1968 .

Some Valid Inequalities for the Set Partitioning Problem

Egon Balas, E. Balas, 1977 .

MINIMAX AND DUALITY FOR LINEAR AND NONLINEAR MIXED-INTEGER PROGRAMMING

Egon Balas, E. Balas, 1969 .

Integer Programming and Convex Analysis.

Egon Balas, 1971 .

DUALITY IN DISCRETE PROGRAMMING. III. NONLINEAR OBJECTIVE FUNCTION AND CONSTRAINTS.

Egon Balas, 1968 .

The Strategic Petroleum Reserve: How Large Should it be?

Egon Balas, E. Balas, 1981 .

Linearizing Nonlinear 0-1 Programs.

Egon Balas, Joseph B. Mazzola, 1980 .

Intersection Cuts from Disjunctive Constraints.

Egon Balas, 1974 .

A duality theorem and an algorithm for (mixed-) integer nonlinear programming

Egon Balas, E. Balas, 1971 .

Mixed integer programming heuristics

Egon Balas, Christopher Wallace, 2010 .

Intersection Cuts from Maximal Convex Extensions of the Ball and the Octahedron.

Egon Balas, 1970 .

Duality in Discrete Programming: II. The Quadratic Case

Egon Balas, E. Balas, 1969 .

THE INTERSECTION CUT - A NEW CUTTING PLANE FOR INTEGER PROGRAMMING.

Egon Balas, E. Balas, 1969 .

Benders's method revisited☆

Egon Balas, E. Balas, C. Bergthaller, 1983 .

Adjacent vertices of the all 0-1 programming polytope

Egon Balas, Manfred W. Padberg, 1979 .

On the cycle polytope of a directed graph and its relaxations

Egon Balas, Rüdiger Stephan, 2009 .

Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes

Egon Balas, Eitan Zemel, E. Balas, 1998 .

Finding a Minimum Node Cover in an Arbitrary Graph.

Egon Balas, Haakon Samuelsson, 1973 .