 | 2009 |
|---|
| 46 |       | Egon Balas:
Integer Programming.
Encyclopedia of Optimization 2009: 1617-1624 |
| 2008 |
|---|
| 45 | | Arrigo Zanette,
Matteo Fischetti,
Egon Balas:
Can Pure Cutting Plane Algorithms Work?.
IPCO 2008: 416-434 |
| 44 | | Egon Balas,
Alan J. Hoffman,
S. Thomas McCormick:
A Special Issue in Memory of George B. Dantzig.
Discrete Optimization 5(2): 145-150 (2008) |
| 43 | | Egon Balas,
Neil Simonetti,
Alkis Vazacopoulos:
Job shop scheduling with setup times, deadlines and precedence constraints.
J. Scheduling 11(4): 253-262 (2008) |
| 42 | | Egon Balas,
Anureet Saxena:
Optimizing over the split closure.
Math. Program. 113(2): 219-240 (2008) |
| 2007 |
|---|
| 41 | | 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 |
| 40 | | Egon Balas:
Some thoughts on the development of integer programming during my research career.
Annals OR 149(1): 19-26 (2007) |
| 2006 |
|---|
| 39 | | Egon Balas,
Rüdiger Stephan:
On the Cycle Polytope of a Directed Graph and Its Relaxations.
OR 2006: 203-208 |
| 38 | | Egon Balas,
Robert Carr,
Matteo Fischetti,
Neil Simonetti:
New facets of the STS polytope generated from known facets of the ATS polytope.
Discrete Optimization 3(1): 3-19 (2006) |
| 2005 |
|---|
| 37 | | Egon Balas:
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization.
Annals OR 140(1): 125-161 (2005) |
| 36 | | Egon Balas,
Cid C. de Souza:
The vertex separator problem: a polyhedral investigation.
Math. Program. 103(3): 583-608 (2005) |
| 35 | | Cid C. de Souza,
Egon Balas:
The vertex separator problem: algorithms and computations.
Math. Program. 103(3): 609-631 (2005) |
| 2004 |
|---|
| 34 | | Egon Balas,
Stefan Schmieta,
Christopher Wallace:
Pivot and shift - a mixed integer programming heuristic.
Discrete Optimization 1(1): 3-12 (2004) |
| 33 | | Egon Balas:
Logical Constraints as Cardinality Rules: Tight Representation.
J. Comb. Optim. 8(2): 115-128 (2004) |
| 32 | | Egon Balas,
Alexander Bockmayr,
Nicolai Pisaruk,
Laurence A. Wolsey:
On unions and dominants of polytopes.
Math. Program. 99(2): 223-239 (2004) |
| 2002 |
|---|
| 31 |  | Egon Balas,
Michael Perregaard:
Lift-and-project for Mixed 0-1 programming: recent progress.
Discrete Applied Mathematics 123(1-3): 129-154 (2002) |
| 30 | | 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): 1-7 (2002) |
| 29 | | 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].
European Journal of Operational Research 143(3): 644 (2002) |
| 2001 |
|---|
| 28 | | Egon Balas:
Projection and Lifting in Combinatorial Optimization.
Computational Combinatorial Optimization 2001: 26-56 |
| 27 | | Michael Perregaard,
Egon Balas:
Generating Cuts from Multiple-Term Disjunctions.
IPCO 2001: 348-360 |
| 26 | | Egon Balas,
Neil Simonetti:
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study.
INFORMS Journal on Computing 13(1): 56-75 (2001) |
| 2000 |
|---|
| 25 | | Egon Balas,
Maarten Oosten:
On the cycle polytope of a directed graph.
Networks 36(1): 34-46 (2000) |
| 1998 |
|---|
| 24 | | Egon Balas,
Maarten Oosten:
On the Dimension of Projected Polyhedra.
Discrete Applied Mathematics 87(1-3): 1-9 (1998) |
| 23 | | Egon Balas:
Disjunctive Programming: Properties of the Convex Hull of Feasible Points.
Discrete Applied Mathematics 89(1-3): 3-44 (1998) |
| 22 | | Egon Balas,
Giuseppe Lancia,
Paolo Serafini,
Alkis Vazacopoulos:
Job Shop Scheduling With Deadlines.
J. Comb. Optim. 1(4): 329-353 (1998) |
| 21 | | 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) |
| 1997 |
|---|
| 20 | | Egon Balas,
Matteo Fischetti:
On the monotonization of polyhedra.
Math. Program. 77: 59-84 (1997) |
| 19 | | Egon Balas:
A modified lift-and-project procedure.
Math. Program. 79: 19-31 (1997) |
| 1996 |
|---|
| 18 | | Neil Simonetti,
Egon Balas:
Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems.
IPCO 1996: 316-329 |
| 17 | | Egon Balas,
Jue Xue:
Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring.
Algorithmica 15(5): 397-412 (1996) |
| 1995 |
|---|
| 16 | | Egon Balas,
Jens Clausen:
Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings
Springer 1995 |
| 15 | | Egon Balas,
Matteo Fischetti,
William R. Pulleyblank:
The precedence-constrained asymmetric traveling salesman polytope.
Math. Program. 68: 241-265 (1995) |
| 1993 |
|---|
| 14 | | Egon Balas,
Matteo Fischetti:
On the monotonization of polyhedra.
IPCO 1993: 23-38 |
| 13 | | Egon Balas,
Sebastián Ceria,
Gérard Cornuéjols:
Solving Mixed 0-1 Programs by a Lift-and-Project Method.
SODA 1993: 232-242 |
| 12 | | Egon Balas,
Liqun Qi:
Linear-Time Separation Algorithms for the Three-Index Assignment Polytope.
Discrete Applied Mathematics 43(1): 1-12 (1993) |
| 11 | | 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) |
| 10 | | 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) |
| 1992 |
|---|
| 9 | | Egon Balas,
Gérard Cornuéjols,
Ravi Kannan:
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992
Carnegie Mellon University 1992 |
| 8 | | 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) |
| 1991 |
|---|
| 7 | | 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) |
| 6 | | 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 |
|---|
| 5 | | Egon Balas:
Finding Out Whether a Valid Inequality is Facet Defining.
IPCO 1990: 45-59 |
| 1989 |
|---|
| 4 | | Egon Balas,
William R. Pulleyblank:
The perfectly matchable subgraph polytope of an arbitrary graph.
Combinatorica 9(4): 321-337 (1989) |
| 3 | | Egon Balas,
Matthew J. Saltzman:
Facets of the three-index assignment polytope.
Discrete Applied Mathematics 23(3): 201-229 (1989) |
| 2 | | Egon Balas:
The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph.
SIAM J. Discrete Math. 2(4): 425-451 (1989) |
| 1986 |
|---|
| 1 | | Egon Balas,
Chang Sung Yu:
Finding a Maximum Clique in an Arbitrary Graph.
SIAM J. Comput. 15(4): 1054-1068 (1986) |
