×

zbMATH — the first resource for mathematics

Balas, Egon

Compute Distance To:
Author ID: balas.egon Recent zbMATH articles by "Balas, Egon"
Published as: Balas, E.; Balas, Egon
External Links: MGP · Wikidata · dblp · GND
Documents Indexed: 169 Publications since 1960, including 7 Books
Biographic References: 2 Publications
all top 5

Serials

18 Mathematical Programming. Series A. Series B
16 Operations Research
7 Discrete Applied Mathematics
7 Networks
5 Management Science
5 Mathematical Programming
5 Discrete Optimization
4 Mathematics of Operations Research
4 Operations Research Letters
4 Annals of Operations Research
4 Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, Paris
4 Academia Republicii Populare Romîne, Studii Şi Cercetări Matematice
3 Mathematical Programming Study
3 SIAM Journal on Computing
3 SIAM Journal on Applied Mathematics
3 Management Science. Ser. A, Theory Series
3 Naval Research Logistics Quarterly
2 European Journal of Operational Research
2 INFORMS Journal on Computing
2 Journal of Combinatorial Optimization
2 Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, Série A
2 Mathematical Programming Computation
1 Discrete Mathematics
1 Revue Roumaine de Mathématiques Pures et Appliquées
1 Acta Mathematica Vietnamica
1 Journal of the Association for Computing Machinery
1 Journal of Computational and Applied Mathematics
1 Journal of Optimization Theory and Applications
1 RAIRO. Recherche Opérationnelle
1 Revue Belge de Statistique, d’Informatique et de Recherche Opérationnelle
1 SIAM Journal on Algebraic and Discrete Methods
1 Combinatorica
1 Algorithmica
1 SIAM Journal on Discrete Mathematics
1 Linear Algebra and its Applications
1 SIAM Review
1 Computational Optimization and Applications
1 Annals of Mathematics and Artificial Intelligence
1 Journal of Heuristics
1 Journal of Scheduling
1 Académie de la République Populaire Roumaine, Revue de Mathématiques Pures et Appliquées
1 Lecture Notes in Computer Science
1 EURO Journal on Computational Optimization

Publications by Year

Citations contained in zbMATH Open

137 Publications have been cited 3,713 times in 2,327 Documents Cited by Year
A lift-and-project cutting plane algorithm for mixed 0-1 programs. Zbl 0796.90041
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
213
1993
The shifting bottleneck procedure for job shop scheduling. Zbl 0637.90051
Adams, Joseph; Balas, Egon; Zawack, Daniel
211
1988
Disjunctive programming. Zbl 0409.90061
Balas, Egon
188
1979
An algorithm for large zero-one knapsack problems. Zbl 0449.90064
Balas, Egon; Zemel, Eitan
158
1980
Facets of the knapsack polytope. Zbl 0316.90046
Balas, Egon
137
1975
Disjunctive programming: Properties of the convex hull of feasible points. Zbl 0921.90118
Balas, Egon
119
1998
Intersection cuts - a new type of cutting planes for integer programming. Zbl 0219.90035
Balas, Egon
104
1971
Set partitioning: A survey. Zbl 0347.90064
Balas, Egon; Padberg, Manfred W.
97
1976
An additive algorithm for solving linear programs with zero-one variables. Zbl 0194.19903
Balas, E.
90
1965
The prize collecting traveling salesman problem. Zbl 0676.90089
Balas, Egon
86
1989
Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. Zbl 0592.90070
Balas, Egon
86
1985
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. Zbl 0435.90074
Balas, Egon; Ho, Andrew
83
1980
Finding a maximum clique in an arbitrary graph. Zbl 0604.05024
Balas, Egon; Yu, Changsung
81
1986
Pivot and complement - a heuristic for 0-1 programming. Zbl 0442.90060
Balas, Egon; Martin, Clarence H.
65
1980
Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Zbl 0183.49404
Balas, Egon
64
1969
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Zbl 0880.90105
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
63
1996
Facets of the knapsack polytope from minimal covers. Zbl 0385.90083
Balas, Egon; Zemel, Eitan
62
1978
Canonical cuts on the unit hypercube. Zbl 0237.52004
Balas, Egon; Jeroslow, Robert
62
1972
Guided local search with shifting bottleneck for job shop scheduling. Zbl 0989.90057
Balas, Egon; Vazacopoulos, Alkis
61
1998
On graphs with polynomially solvable maximum-weight clique problem. Zbl 0661.05036
Balas, Egon; Yu, Chang Sung
57
1989
Gomory cuts revisited. Zbl 0865.90098
Balas, E.; Ceria, S.; Cornuéjols, G.; Natraj, N.
56
1996
A restricted Lagrangean approach to the traveling salesman problem. Zbl 0461.90068
Balas, Egon; Christofides, Nicos
49
1981
Optimizing over the split closure. Zbl 1135.90030
Balas, Egon; Saxena, Anureet
47
2008
An algorithm for the three-index assignment problem. Zbl 0743.90079
Balas, Egon; Saltzman, Matthew J.
44
1991
Strengthening cuts for mixed integer programs. Zbl 0439.90064
Balas, Egon; Jeroslow, Robert G.
44
1980
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming. Zbl 1030.90068
Balas, Egon; Perregaard, Michael
41
2003
The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Zbl 0824.90076
Balas, Egon; Lenstra, Jan Karel; Vazacopoulos, Alkis
40
1995
The precedence-constrained asymmetric traveling salesman polytope. Zbl 0835.90109
Balas, Egon; Fischetti, Matteo; Pulleyblank, William R.
39
1995
On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\). Zbl 0674.90079
Balas, Egon; Ng, Shu Ming
39
1989
Minimax and duality for linear and nonlinear mixed-integer programming. Zbl 0346.90071
Balas, E.
39
1970
Branch and bound methods. Zbl 0568.90068
Balas, E.; Toth, P.
38
1985
The perfectly matchable subgraph polytope of a bipartite graph. Zbl 0525.90069
Balas, Egon; Pulleyblank, William
38
1983
Disjunctive programming: Cutting planes from logical conditions. Zbl 0349.90117
Balas, Egon
35
1975
On the set-covering problem. Zbl 0254.90035
Balas, Egon; Padberg, Manfred W.
34
1972
Nonlinear 0-1 programming. I: Linearization techniques. Zbl 0553.90067
Balas, Egon; Mazzola, Joseph B.
31
1984
A dynamic subgradient-based branch-and-bound procedure for set covering. Zbl 0879.90155
Balas, Egon; Carrera, Maria C.
29
1996
Discrete programming by the filter method. Zbl 0153.21401
Balas, E.
29
1967
On the set-covering problem. II: An algorithm for set partitioning. Zbl 0324.90045
Balas, Egon; Padberg, Manfred
28
1975
Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study. Zbl 1238.90126
Balas, Egon; Simonetti, Neil
26
2001
Facets of the three-index assignment polytope. Zbl 0723.90065
Balas, Egon; Saltzman, Matthew J.
26
1989
Lift-and-project for mixed 0-1 programming: recent progress. Zbl 1076.90031
Balas, Egon; Perregaard, Michael
25
2002
Octane: A new heuristic for pure 0-1 programs. Zbl 1163.90654
Balas, Egon; Ceria, Sebastián; Dawande, Milind; Margot, Francois; Pataki, Gábor
24
2001
The vertex separator problem: a polyhedral investigation. Zbl 1099.90065
Balas, Egon; de Souza, Cid C.
23
2005
Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs. Zbl 0722.68086
Balas, Egon; Xue, Jue
23
1991
Pivot and shift – a mixed integer programming heuristic. Zbl 1087.90052
Balas, Egon; Schmieta, Stefan; Wallace, Christopher
21
2004
On the facial structure of scheduling polyhedra. Zbl 0582.90053
Balas, Egon
21
1985
On the dimension of projected polyhedra. Zbl 0910.90234
Balas, Egon; Oosten, Maarten
20
1998
The perfectly matchable subgraph polytope of an arbitrary graph. Zbl 0723.05087
Balas, E.; Pulleyblank, W. R.
20
1989
Cutting planes from conditional bounds: A new approach to set covering. Zbl 0435.90073
Balas, Egon
20
1980
A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets. Zbl 0780.90100
Balas, Egon; Fischetti, Matteo
19
1993
Nonlinear 0-1 programming. II: Dominance relations and algorithms. Zbl 0553.90068
Balas, Egon; Mazzola, Joseph B.
19
1984
Projection, lifting and extended formulation integer and combinatorial optimization. Zbl 1091.90041
Balas, Egon
18
2005
The vertex separator problem: algorithms and computations. Zbl 1099.90069
de Souza, Cid; Balas, Egon
18
2005
A parallel shortest augmenting path algorithm for the assignment problem. Zbl 0799.68111
Balas, Egon; Miller, Donald; Pekny, Joseph; Toth, Paolo
18
1991
The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. Zbl 0725.05053
Balas, Egon
18
1989
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Zbl 0846.68078
Balas, E.; Xue, Jue
17
1996
Job shop scheduling with setup times, deadlines and precedence constraints. Zbl 1168.90419
Balas, Egon; Simonetti, Neil; Vazacopoulos, Alkis
16
2008
Integer and fractional matchings. Zbl 0481.05055
Balas, Egon
16
1981
New classes of efficiently solvable generalized traveling salesman problems. Zbl 0922.90138
Balas, Egon
15
1999
Polyhedral methods for the maximum clique problem. Zbl 0864.90115
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard; Pataki, Gábor
15
1996
Critical cutsets of graphs and canonical facets of set-packing polytopes. Zbl 0447.52010
Balas, Egon; Zemel, Eitan
15
1977
On the convex hull of the union of certain polyhedra. Zbl 0663.90061
Balas, Egon
14
1988
On the maximum weight clique problem. Zbl 0624.05040
Balas, Egon; Chvátal, Vašek; Nešetřil, Jaroslav
14
1987
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Zbl 1180.90206
Balas, Egon; Bonami, Pierre
13
2009
Lifting and complementing yields all the facets of positive zero-one programming polytopes. Zbl 0548.90048
Balas, Egon; Zemel, Eitan
13
1984
Traffic assignment in communication satellites. Zbl 0526.90065
Balas, Egon; Landweer, Philip R.
13
1983
Duality in discrete programming. II: The quadratic case. Zbl 0191.48202
Balas, E.
13
1969
Lexicography and degeneracy: Can a pure cutting plane algorithm work? Zbl 1229.90101
Zanette, Arrigo; Fischetti, Matteo; Balas, Egon
12
2011
On the cycle polytope of a directed graph. Zbl 0969.90071
Balas, Egon; Oosten, Maarten
12
2000
Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. Zbl 0917.68162
Balas, Egon; Niehaus, William
12
1998
Linear-time separation algorithms for the three-index assignment polytope. Zbl 0781.90069
Balas, Egon; Qi, Liqun
12
1993
Set partitioning - a survey. Zbl 0413.90047
Balas, Egon; Padberg, Manfred W.
11
1979
A note on the branch-and-bound principle. Zbl 0186.24901
Balas, E.
11
1968
Extension de l’algorithme additif à la programmation en nombres entiers et à la programmation non linéaire. Zbl 0208.45705
Balas, E.
11
1964
On the generalized transportation problem. Zbl 0133.42505
Balas, E.; Ivanescu, P. L.
11
1964
Generalized intersection cuts and a new cut generating paradigm. Zbl 1262.90099
Balas, Egon; Margot, François
10
2013
Generating cuts from multiple-term disjunctions. Zbl 1010.90043
Perregaard, Michael; Balas, Egon
10
2001
The prize collecting traveling salesman problem. II: Polyhedral results. Zbl 0843.90120
Balas, Egon
10
1995
On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\). Zbl 0692.90073
Balas, Egon; Ng, Shu Ming
10
1989
Sequential convexification in reverse convex and disjunctive programming. Zbl 0683.90063
Balas, Egon; Tama, Joseph M.; Tind, Jørgen
10
1989
A class of location, distribution and scheduling problems: Modeling and solution methods. Zbl 0524.90064
Balas, Egon
10
1982
A note on duality in disjunctive programming. Zbl 0336.90037
Balas, E.
10
1977
Integer programming and convex analysis: Intersection cuts from outer polars. Zbl 0259.90023
Balas, Egon
10
1972
Polyhedral theory for the asymmetric traveling salesman problem. Zbl 1113.90349
Balas, Egon; Fischetti, Matteo
9
2002
Projection and lifting in combinatorial optimization. Zbl 1052.90061
Balas, Egon
9
2001
The prize collecting traveling salesman problem and its applications. Zbl 1113.90348
Balas, Egon
8
2002
Lifted cycle inequalities for the asymmetric traveling salesman problem. Zbl 0977.90040
Balas, Egon; Fischetti, Matteo
8
1999
On the monotonization of polyhedra. Zbl 0890.90153
Balas, Egon; Fischetti, Matteo
8
1997
A modified lift-and-project procedure. Zbl 0887.90127
Balas, Egon
8
1997
A new facet class and a polyhedral method for the three-index assignment problem. Zbl 0830.90105
Qi, Liqun; Balas, Egon; Gwan, Geena
8
1994
The fixed-outdegree 1-arborescence polytope. Zbl 0770.90072
Balas, Egon; Fischetti, Matteo
8
1992
A node covering algorithm. Zbl 0381.90093
Balas, Egon; Samuelsson, Haakon
8
1977
A duality theorem and an algorithm for (mixed-) integer nonlinear programming. Zbl 0225.90032
Balas, Egon
8
1971
Solution of large scale transportation problems through aggregation. Zbl 0137.38502
Balas, E.
8
1965
On unions and dominants of polytopes. Zbl 1098.90092
Balas, Egon; Bockmayr, Alexander; Pisaruk, Nicolai; Wolsey, Laurence
7
2004
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Zbl 0633.05039
Balas, Egon
7
1986
Disjunctive programming. Zbl 1187.90005
Balas, Egon
6
2010
Implementation of a linear time algorithm for certain generalized traveling salesman problems. Zbl 1415.90108
Simonetti, Neil; Balas, Egon
6
1996
An intersection cut from the dual of the unit hypercube. Zbl 0219.90036
Balas, Egon; Bowman, V. Joseph; Glover, Fred; Sommer, David
6
1971
The dual method for the generalized transportation problem. Zbl 0142.16601
Balas, E.
6
1966
Disjunctive programming. Zbl 1414.90001
Balas, Egon
1
2018
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts. Zbl 1370.90152
Balas, Egon; Kis, Tamás
1
2016
Intersection cuts – standard versus restricted. Zbl 1387.90151
Balas, E.; Kis, Tamas
2
2015
Generalized intersection cuts and a new cut generating paradigm. Zbl 1262.90099
Balas, Egon; Margot, François
10
2013
Intersection cuts from multiple rows: a disjunctive programming approach. Zbl 1296.90080
Balas, Egon; Qualizza, Andrea
2
2013
Monoidal cut strengthening revisited. Zbl 1242.90115
Balas, E.; Qualizza, A.
3
2012
A hard integer program made easy by lexicography. Zbl 1254.90120
Balas, Egon; Fischetti, Matteo; Zanette, Arrigo
1
2012
Lexicography and degeneracy: Can a pure cutting plane algorithm work? Zbl 1229.90101
Zanette, Arrigo; Fischetti, Matteo; Balas, Egon
12
2011
Projecting systems of linear inequalities with binary variables. Zbl 1254.90116
Balas, Egon
1
2011
Disjunctive programming. Zbl 1187.90005
Balas, Egon
6
2010
On the enumerative nature of Gomory’s dual cutting plane method. Zbl 1201.90135
Balas, Egon; Fischetti, Matteo; Zanette, Arrigo
1
2010
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Zbl 1180.90206
Balas, Egon; Bonami, Pierre
13
2009
On the cycle polytope of a directed graph and its relaxations. Zbl 1207.05066
Balas, Egon; Stephan, Rüdiger
2
2009
Optimizing over the split closure. Zbl 1135.90030
Balas, Egon; Saxena, Anureet
47
2008
Job shop scheduling with setup times, deadlines and precedence constraints. Zbl 1168.90419
Balas, Egon; Simonetti, Neil; Vazacopoulos, Alkis
16
2008
Can pure cutting plane algorithms work? Zbl 1143.90398
Zanette, Arrigo; Fischetti, Matteo; Balas, Egon
2
2008
New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing. Zbl 1136.90399
Balas, Egon; Bonami, Pierre
5
2007
On the cycle polytope of a directed graph and its relaxations. Zbl 1209.05104
Balas, Egon; Stephan, Rüdiger
1
2007
New facets of the STS polytope generated from known facets of the ATS polytope. Zbl 1110.90081
Balas, Egon; Carr, Robert; Fischetti, Matteo; Simonetti, Neil
3
2006
The vertex separator problem: a polyhedral investigation. Zbl 1099.90065
Balas, Egon; de Souza, Cid C.
23
2005
Projection, lifting and extended formulation integer and combinatorial optimization. Zbl 1091.90041
Balas, Egon
18
2005
The vertex separator problem: algorithms and computations. Zbl 1099.90069
de Souza, Cid; Balas, Egon
18
2005
Pivot and shift – a mixed integer programming heuristic. Zbl 1087.90052
Balas, Egon; Schmieta, Stefan; Wallace, Christopher
21
2004
On unions and dominants of polytopes. Zbl 1098.90092
Balas, Egon; Bockmayr, Alexander; Pisaruk, Nicolai; Wolsey, Laurence
7
2004
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming. Zbl 1030.90068
Balas, Egon; Perregaard, Michael
41
2003
Lift-and-project for mixed 0-1 programming: recent progress. Zbl 1076.90031
Balas, Egon; Perregaard, Michael
25
2002
Polyhedral theory for the asymmetric traveling salesman problem. Zbl 1113.90349
Balas, Egon; Fischetti, Matteo
9
2002
The prize collecting traveling salesman problem and its applications. Zbl 1113.90348
Balas, Egon
8
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. Zbl 0998.90500
Balas, Egon
1
2002
Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study. Zbl 1238.90126
Balas, Egon; Simonetti, Neil
26
2001
Octane: A new heuristic for pure 0-1 programs. Zbl 1163.90654
Balas, Egon; Ceria, Sebastián; Dawande, Milind; Margot, Francois; Pataki, Gábor
24
2001
Generating cuts from multiple-term disjunctions. Zbl 1010.90043
Perregaard, Michael; Balas, Egon
10
2001
Projection and lifting in combinatorial optimization. Zbl 1052.90061
Balas, Egon
9
2001
On the cycle polytope of a directed graph. Zbl 0969.90071
Balas, Egon; Oosten, Maarten
12
2000
Will to freedom. A perilous journey through fascism and communism. Zbl 1230.01026
Balas, Egon
2
2000
New classes of efficiently solvable generalized traveling salesman problems. Zbl 0922.90138
Balas, Egon
15
1999
Lifted cycle inequalities for the asymmetric traveling salesman problem. Zbl 0977.90040
Balas, Egon; Fischetti, Matteo
8
1999
Disjunctive programming: Properties of the convex hull of feasible points. Zbl 0921.90118
Balas, Egon
119
1998
Guided local search with shifting bottleneck for job shop scheduling. Zbl 0989.90057
Balas, Egon; Vazacopoulos, Alkis
61
1998
On the dimension of projected polyhedra. Zbl 0910.90234
Balas, Egon; Oosten, Maarten
20
1998
Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. Zbl 0917.68162
Balas, Egon; Niehaus, William
12
1998
Job shop scheduling with deadlines. Zbl 0897.90120
Balas, Egon; Lancia, Giuseppe; Serafini, Paolo; Vazacopoulos, Alkiviadis
5
1998
Projection with a minimal system of inequalities. Zbl 0895.90153
Balas, Egon
1
1998
On the monotonization of polyhedra. Zbl 0890.90153
Balas, Egon; Fischetti, Matteo
8
1997
A modified lift-and-project procedure. Zbl 0887.90127
Balas, Egon
8
1997
Recognizing facet defining inequalities. Zbl 0895.90154
Balas, E.
1
1997
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Zbl 0880.90105
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
63
1996
Gomory cuts revisited. Zbl 0865.90098
Balas, E.; Ceria, S.; Cornuéjols, G.; Natraj, N.
56
1996
A dynamic subgradient-based branch-and-bound procedure for set covering. Zbl 0879.90155
Balas, Egon; Carrera, Maria C.
29
1996
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Zbl 0846.68078
Balas, E.; Xue, Jue
17
1996
Polyhedral methods for the maximum clique problem. Zbl 0864.90115
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard; Pataki, Gábor
15
1996
Implementation of a linear time algorithm for certain generalized traveling salesman problems. Zbl 1415.90108
Simonetti, Neil; Balas, Egon
6
1996
Finding large cliques in arbitrary graphs by bipartite matching. Zbl 0864.90116
Balas, Egon; Niehaus, William
4
1996
The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Zbl 0824.90076
Balas, Egon; Lenstra, Jan Karel; Vazacopoulos, Alkis
40
1995
The precedence-constrained asymmetric traveling salesman polytope. Zbl 0835.90109
Balas, Egon; Fischetti, Matteo; Pulleyblank, William R.
39
1995
The prize collecting traveling salesman problem. II: Polyhedral results. Zbl 0843.90120
Balas, Egon
10
1995
A new facet class and a polyhedral method for the three-index assignment problem. Zbl 0830.90105
Qi, Liqun; Balas, Egon; Gwan, Geena
8
1994
A lift-and-project cutting plane algorithm for mixed 0-1 programs. Zbl 0796.90041
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
213
1993
A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets. Zbl 0780.90100
Balas, Egon; Fischetti, Matteo
19
1993
Linear-time separation algorithms for the three-index assignment polytope. Zbl 0781.90069
Balas, Egon; Qi, Liqun
12
1993
Solving mixed \(0-1\) programs by a lift-and-project method. Zbl 0808.90100
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
5
1993
On the monotonization of polyhedra. Zbl 0923.90123
Balas, Egon; Fischetti, Matteo
1
1993
The fixed-outdegree 1-arborescence polytope. Zbl 0770.90072
Balas, Egon; Fischetti, Matteo
8
1992
An algorithm for the three-index assignment problem. Zbl 0743.90079
Balas, Egon; Saltzman, Matthew J.
44
1991
Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs. Zbl 0722.68086
Balas, Egon; Xue, Jue
23
1991
A parallel shortest augmenting path algorithm for the assignment problem. Zbl 0799.68111
Balas, Egon; Miller, Donald; Pekny, Joseph; Toth, Paolo
18
1991
The prize collecting traveling salesman problem. Zbl 0676.90089
Balas, Egon
86
1989
On graphs with polynomially solvable maximum-weight clique problem. Zbl 0661.05036
Balas, Egon; Yu, Chang Sung
57
1989
On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\). Zbl 0674.90079
Balas, Egon; Ng, Shu Ming
39
1989
Facets of the three-index assignment polytope. Zbl 0723.90065
Balas, Egon; Saltzman, Matthew J.
26
1989
The perfectly matchable subgraph polytope of an arbitrary graph. Zbl 0723.05087
Balas, E.; Pulleyblank, W. R.
20
1989
The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. Zbl 0725.05053
Balas, Egon
18
1989
On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\). Zbl 0692.90073
Balas, Egon; Ng, Shu Ming
10
1989
Sequential convexification in reverse convex and disjunctive programming. Zbl 0683.90063
Balas, Egon; Tama, Joseph M.; Tind, Jørgen
10
1989
The shifting bottleneck procedure for job shop scheduling. Zbl 0637.90051
Adams, Joseph; Balas, Egon; Zawack, Daniel
211
1988
On the convex hull of the union of certain polyhedra. Zbl 0663.90061
Balas, Egon
14
1988
On the maximum weight clique problem. Zbl 0624.05040
Balas, Egon; Chvátal, Vašek; Nešetřil, Jaroslav
14
1987
The assignable subgraph polytope of a directed graph. Zbl 0659.05050
Balas, Egon
2
1987
Finding a maximum clique in an arbitrary graph. Zbl 0604.05024
Balas, Egon; Yu, Changsung
81
1986
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Zbl 0633.05039
Balas, Egon
7
1986
Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. Zbl 0592.90070
Balas, Egon
86
1985
Branch and bound methods. Zbl 0568.90068
Balas, E.; Toth, P.
38
1985
On the facial structure of scheduling polyhedra. Zbl 0582.90053
Balas, Egon
21
1985
Nonlinear 0-1 programming. I: Linearization techniques. Zbl 0553.90067
Balas, Egon; Mazzola, Joseph B.
31
1984
Nonlinear 0-1 programming. II: Dominance relations and algorithms. Zbl 0553.90068
Balas, Egon; Mazzola, Joseph B.
19
1984
Lifting and complementing yields all the facets of positive zero-one programming polytopes. Zbl 0548.90048
Balas, Egon; Zemel, Eitan
13
1984
A sharp bound on the ratio between optimal integer and fractional covers. Zbl 0537.90077
Balas, Egon
3
1984
The perfectly matchable subgraph polytope of a bipartite graph. Zbl 0525.90069
Balas, Egon; Pulleyblank, William
38
1983
Traffic assignment in communication satellites. Zbl 0526.90065
Balas, Egon; Landweer, Philip R.
13
1983
Bender’s method revisited. Zbl 0512.65049
Balas, Egon; Bergthaller, Christian
4
1983
Correction to ”Disjunctive programming”. Zbl 0501.90068
Balas, E.
4
1983
A class of location, distribution and scheduling problems: Modeling and solution methods. Zbl 0524.90064
Balas, Egon
10
1982
A restricted Lagrangean approach to the traveling salesman problem. Zbl 0461.90068
Balas, Egon; Christofides, Nicos
49
1981
Integer and fractional matchings. Zbl 0481.05055
Balas, Egon
16
1981
An algorithm for large zero-one knapsack problems. Zbl 0449.90064
Balas, Egon; Zemel, Eitan
158
1980
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. Zbl 0435.90074
Balas, Egon; Ho, Andrew
83
1980
Pivot and complement - a heuristic for 0-1 programming. Zbl 0442.90060
Balas, Egon; Martin, Clarence H.
65
1980
Strengthening cuts for mixed integer programs. Zbl 0439.90064
Balas, Egon; Jeroslow, Robert G.
44
1980
Cutting planes from conditional bounds: A new approach to set covering. Zbl 0435.90073
Balas, Egon
20
1980
Disjunctive programming. Zbl 0409.90061
Balas, Egon
188
1979
...and 37 more Documents
all top 5

Cited by 3,053 Authors

52 Balas, Egon
41 Sherali, Hanif D.
37 Fischetti, Matteo
34 Pardalos, Panos M.
30 Cornuéjols, Gérard P.
24 Glover, Fred W.
24 Grossmann, Ignacio E.
24 Lodi, Andrea
22 Wolsey, Laurence Alexander
20 Dash, Sanjeeb
20 Günlük, Oktay
18 Letchford, Adam N.
16 Laporte, Gilbert
15 Basu, Amitabh
15 Bonami, Pierre
15 Conforti, Michele
15 Weismantel, Robert
14 Nemhauser, George L.
14 Toth, Paolo
14 Vielma, Juan Pablo
13 Dey, Santanu S.
13 Pisinger, David
13 Salazar-González, Juan-José
12 Escalante, Mariana S.
12 Escudero, Laureano Fernando
12 Hanafi, Saïd
12 Jeroslow, Robert G.
12 Sen, Suvrajeet
11 Gutin, Gregory Z.
11 Hansen, Pierre
11 Monaci, Michele
11 Nasini, Graciela L.
11 Padberg, Manfred W.
10 Atamtürk, Alper
10 de Souza, Cid Carvalho
10 Jörnsten, Kurt O.
10 Paulusma, Daniël
10 Plateau, Gérard
10 Richard, Jean-Philippe Pascal
10 Smith, J. Cole
9 Adams, Warren Philips
9 Agra, Agostinho
9 Crama, Yves
9 Hifi, Mhand
9 Hildebrand, Robert
9 Margot, François
9 Minoux, Michel Andre
9 Sergeev, S. I.
8 Brucker, Peter J.
8 Caprara, Alberto
8 Castro, Pedro M.
8 Gendreau, Michel
8 Goldengorin, Boris I.
8 Hertz, Alain
8 Kis, Tamás
8 Lozin, Vadim Vladislavovich
8 Maculan, Nelson F.
8 Mahjoub, Ali Ridha
8 Molinaro, Marco
8 Rossi, Fabrizio
8 Sassano, Antonio
8 Smriglio, Stefano
8 Woeginger, Gerhard Johannes
7 Bienstock, Daniel
7 Boros, Endre
7 Burkard, Rainer E.
7 Cheng, Tai-Chiu Edwin
7 Cook, William John
7 Elhallaoui, Issmail
7 Figueira, José Rui
7 Fréville, Arnaud
7 Fukasawa, Ricardo
7 Ibaraki, Toshihide
7 Irnich, Stefan
7 Krokhmal, Pavlo A.
7 Linderoth, Jeff T.
7 Ljubić, Ivana
7 Mazzola, Joseph B.
7 Mitchell, John E.
7 Mourtos, Ioannis
7 Nguyen, Kien Trung
7 Ralphs, Ted K.
7 Resende, Mauricio G. C.
7 Soumis, François
7 Spieksma, Frits C. R.
7 Tawarmalani, Mohit
7 Tunçel, Levent
7 Uzsoy, Reha
6 Alizadeh, Behrooz
6 Anjos, Miguel F.
6 Beck, J. Christopher
6 Belotti, Pietro
6 Bianchi, Silvia M.
6 Brandstädt, Andreas
6 Constantino, Miguel Fragoso
6 Cordeau, Jean-François
6 Dauzère-Pérès, Stéphane
6 De Farias, Ismael Regis jun.
6 de Werra, Dominique
6 Del Pia, Alberto
...and 2,953 more Authors
all top 5

Cited in 185 Serials

388 European Journal of Operational Research
206 Mathematical Programming. Series A. Series B
175 Discrete Applied Mathematics
173 Computers & Operations Research
138 Operations Research Letters
108 Annals of Operations Research
70 Discrete Optimization
57 Journal of Global Optimization
49 Mathematical Programming
39 International Journal of Production Research
34 Computational Optimization and Applications
33 Journal of Combinatorial Optimization
32 Mathematical Programming Computation
30 INFORMS Journal on Computing
29 Optimization Letters
28 Journal of Scheduling
26 Discrete Mathematics
26 Journal of Optimization Theory and Applications
25 Theoretical Computer Science
21 Optimization
20 Networks
18 Applied Mathematics and Computation
16 International Transactions in Operational Research
15 Algorithmica
15 Top
15 Journal of Heuristics
13 Artificial Intelligence
13 Information Processing Letters
12 OR Spektrum
12 EURO Journal on Computational Optimization
11 Mathematics of Operations Research
11 Naval Research Logistics
11 Mathematical and Computer Modelling
11 RAIRO. Operations Research
11 Naval Research Logistics Quarterly
10 Computing
10 Automation and Remote Control
10 4OR
9 Operations Research
9 Mathematical Problems in Engineering
9 Optimization Methods & Software
8 Computers & Mathematics with Applications
8 Information Sciences
8 Opsearch
8 SIAM Journal on Optimization
8 Mathematical Methods of Operations Research
7 Applied Mathematical Modelling
7 Zeitschrift für Operations Research. Serie A: Theorie
7 ZOR. Zeitschrift für Operations Research
6 Journal of Computational and Applied Mathematics
6 Journal of Computer and System Sciences
6 Cybernetics
6 Asia-Pacific Journal of Operational Research
6 Annals of Mathematics and Artificial Intelligence
5 Linear Algebra and its Applications
5 Optimization and Engineering
4 Journal of Mathematical Analysis and Applications
4 Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM)
4 Journal of Combinatorial Theory. Series B
4 Journal of Information & Optimization Sciences
4 Combinatorica
4 International Journal of Computer Mathematics
4 Constraints
4 JMMA. Journal of Mathematical Modelling and Algorithms
4 Journal of Discrete Algorithms
4 Journal of Industrial and Management Optimization
3 Mathematical Biosciences
3 Psychometrika
3 Aplikace Matematiky
3 Automatica
3 International Journal of Computer & Information Sciences
3 Trabajos de Investigacion Operativa
3 Discrete Mathematics and Applications
3 Cybernetics and Systems Analysis
3 Natural Computing
3 Journal of Applied Mathematics and Computing
3 Journal of Mathematical Modelling and Algorithms in Operations Research
2 Applied Mathematics and Optimization
2 Software. Practice & Experience
2 Statistica Neerlandica
2 Trabajos de Estadistica y de Investigacion Operativa
2 Systems & Control Letters
2 Journal of Classification
2 Applied Numerical Mathematics
2 Acta Mathematicae Applicatae Sinica. English Series
2 Discrete & Computational Geometry
2 Journal of Automated Reasoning
2 SIAM Journal on Discrete Mathematics
2 Japan Journal of Industrial and Applied Mathematics
2 Computational Geometry
2 Discrete Event Dynamic Systems
2 Russian Mathematics
2 The Electronic Journal of Combinatorics
2 Doklady Mathematics
2 Journal of Vibration and Control
2 Soft Computing
2 Journal of Applied Mathematics
2 OR Spectrum
2 Fuzzy Optimization and Decision Making
2 Computational Management Science
...and 85 more Serials

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.