E. Balas

发表

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

E. Balas, 1965 .

Disjunctive programming and a hierarchy of relaxations for discrete optimization problems

E. Balas, 1985 .

A Note on the Weiszfeld-Kuhn Algorithm for the General Fermat Problem.

E. Balas, C. Yu, 1982 .

The Shifting Bottleneck Procedure for Job Shop Scheduling

Egon Balas, Joseph Adams, Daniel Zawack, 1988 .

Pivot and Complement–A Heuristic for 0-1 Programming

E. Balas, Clarence H. Martin, 1980 .

Set Partitioning: A survey

E. Balas, M. Padberg, 1976 .

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

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

Adjacent Vertices of the Convex Hull of Feasible 0-1 Points.

E. Balas, M. Padberg, 1973 .

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

E. Balas, G. Cornuéjols, S. Ceria, 1996 .

Strengthening cuts for mixed integer programs

E. Balas, R. Jeroslow, 1980 .

Facets of the Knapsack Polytope From Minimal Covers

E. Balas, Eitan Zemel, 1978 .

Canonical Cuts on the Unit Hypercube

E. Balas, R. Jeroslow, 1972 .

The one-machine problem with delayed precedence constraints and its use in job shop scheduling

E. Balas, J. Lenstra, A. Vazacopoulos, 1995 .

On the facial structure of scheduling polyhedra

E. Balas, 1985 .

DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS

E. Balas, 1975 .

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

Andrew C. Ho, E. Balas, 1980 .

Solution of Large-Scale Transportation Problems Through Aggregation

E. Balas, 1965 .

Maximizing a Convex Quadratic Function Subject to Linear Constraints.

E. Balas, C. Burdet, 1973 .

On the Generalized Transportation Problem

E. Balas, P. L. Ivanescu, 1964 .

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..

Minimum Weighted Coloring Of Triangulated Graphs, With Application To Weighted Vertex Packing In Arbitrary Graphs

E. Balas, J. Xue, 1989 .

Nonconvex Quadratic Programming via Generalized Polars

E. Balas, 1975 .

An Intersection Cut from the Dual of the Unit Hypercube

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

A class of location, distribution and scheduling problems : modeling and solution methods

E. Balas, 1982 .

The Dual Method for the Generalized Transportation Problem

E. Balas, 1966 .

Solving Large Zero-One Knapsack Problems.

E. Balas, Eitan Zemel, 1977 .

Alternative Strategies for Using Intersection Cuts in Integer Programming.

E. Balas, 1970 .

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

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

Machine sequencing: Disjunctive graphs and degree‐constrained subgraphs

E. Balas, 1970 .

Branch and Bound Methods for the Traveling Salesman Problem

E. Balas, P. Toth, 1983 .

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

Egon Balas, E. Balas, 1969 .

A Linear Characterization of Permutation Vectors.

E. Balas, 1975 .

Integer and Fractional Matchings

E. Balas, 1981 .

Cutting planes from conditional bounds: A new approach to set covering

E. Balas, 1980 .

Participants Teachers

E. Balas, M. Anjos, M. Jünger, 2022 .

Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes

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

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

Egon Balas, E. Balas, 1971 .

Duality in Discrete Programming: II. The Quadratic Case

Egon Balas, E. Balas, 1969 .

Long- and Short-Term Interest Rates in a Risky World

E. Balas, 2015 .

Polyhedral methods for the maximum clique problem

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

The Convex Hull of a Disjunctive Set

E. Balas, 2018 .

The perfectly matchable subgraph polytope

E. Balas, W. Pulleyblank, 1982 .

Mathematical Programming and Logical Inference

E. Balas, G. Cornuéjols, J. Hooker, 1990 .

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

Egon Balas, E. Balas, 1971 .

Disjunctive Programming and Its Relation to Integer Programming

E. Balas, 2018 .

Traffic assignment in communication satellites

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

Integer Programming

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

Cuts from General Disjunctions

E. Balas, 2018 .

Moving Between Conjunctive and Disjunctive Normal Forms

E. Balas, 2018 .

N < 3 BRANCH AND BOUND METHODS FOR THE TRAVELING SALESMAN PROBLEM by

E. Balas, 2012 .

Stronger Cuts from Weaker Disjunctions

E. Balas, Andrea Qualizza, 2010 .

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

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

$\mathcal{V}$-Polyhedral Disjunctive Cuts

Aleksandr M. Kazachkov, E. Balas, 2022, 2207.13619.

In 0 D In * 4

E. Balas, 2022 .

Bucknell Digital Commons Bucknell Digital Commons When Lift-and-Project Cuts are Different When Lift-and-Project Cuts are Different

E. Balas, Thiago Serra, Bucknell, 2021 .

A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM

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

Finding large cliques in arbitrary graphs by bipartite matching

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

Generalized intersection cuts and a new cut generating paradigm

E. Balas, F. Margot, 2011, Mathematical Programming.

Finding a Maximum Clique in an Arbitrary Graph

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

On the Set-Covering Problem

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

Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

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

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

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

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

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

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..

A restricted Lagrangean approach to the traveling salesman problem

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

Set Covering with Cutting Planes from Conditional Bounds.

Egon Balas, E. Balas, 1977 .

An Algorithm for the Three-Index Assignment Problem

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

PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS.

Egon Balas, E. Balas, 1968 .

Integer programming and convex analysis: Intersection cuts from outer polars

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

Discrete Programming by the Filter Method

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

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..

Generating Cuts from Multiple-Term Disjunctions

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

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

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

Polyhedral Theory for the Asymmetric Traveling Salesman Problem

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

Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem

Egon Balas, Matteo Fischetti, E. Balas, 1999, Math. 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..

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

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

A parallel shortest augmenting path algorithm for the assignment problem

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

The prize collecting traveling salesman problem

Egon Balas, E. Balas, 1989, Networks.

MINIMAX AND DUALITY FOR LINEAR AND NONLINEAR MIXED-INTEGER PROGRAMMING

Egon Balas, E. Balas, 1969 .

New classes of efficiently solvable generalized Traveling Salesman Problems

E. Balas, E. Balas, 1999, Ann. Oper. Res..

CMU Tepper School of Business 1983 Traffic assignment in communication satellites

E. Balas, P. Landweer, 2015 .

On the Maximum Weight Clique Problem

Egon Balas, Jaroslav Nesetril, Vasek Chvátal, 1987, Math. 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..

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..

The perfectly matchable subgraph polytope of a bipartite graph

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

Graph substitution and set packing polytopes

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

Some Valid Inequalities for the Set Partitioning Problem

Egon Balas, E. Balas, 1977 .

programming: Properties of the convex hull of feasible points *

Egon Balas, E. Balas, 1998 .

One Machine Scheduling With Delayed Precedence Constraints.

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

An Infeasibility-Pricing Decomposition Method for Linear Programs

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

The Strategic Petroleum Reserve: How Large Should it be?

Egon Balas, E. Balas, 1981 .

The prize collecting traveling salesman problem: II. Polyhedral results

Egon Balas, E. Balas, 1995, Networks.

An Algorithm for Large Zero-One Knapsack Problems

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

Pivot and shift - a mixed integer programming heuristic

E. Balas, S. Schmieta, Christopher Wallace, 2004, Discret. Optim..

Octane: A New Heuristic for Pure 0-1 Programs

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

Partial hyperplane activation for generalized intersection cuts

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

Benders's method revisited☆

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

Gomory cuts revisited

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

Facets of the knapsack polytope

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

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

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

Nonlinear 0–1 programming: I. Linearization techniques

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

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

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

Job Shop Scheduling With Deadlines

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

Job shop scheduling with setup times, deadlines and precedence constraints

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

The precedence-constrained asymmetric traveling salesman polytope

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

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

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

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

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

Disjunctive Programming: Properties of the Convex Hull of Feasible Points

E. Balas, 1998, Discret. Appl. Math..

The vertex separator problem: a polyhedral investigation

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

Monoidal strengthening of simple $\mathcal{V}$-polyhedral disjunctive cuts

Aleksandr M. Kazachkov, E. Balas, 2023, 2303.00237.

Intersection cuts from multiple rows: a disjunctive programming approach

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

Optimizing over the split closure

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

Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization

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

On the monotonization of polyhedra

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

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

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

Facets of the three-index assignment polytope

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

On graphs with polynomially solvable maximum-weight clique problem

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

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

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

On unions and dominants of polytopes

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

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..

Generalized intersection cuts and a new cut generating paradigm

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