Citation: E. Balas et W. Niehaus, OPTIMIZED CROSSOVER-BASED GENETIC ALGORITHMS FOR THE MAXIMUM CARDINALITY AND MAXIMUM WEIGHT CLIQUE PROBLEMS, Journal of heuristics, 4(2), 1998, pp. 107-122
Citation: E. Balas et A. Vazacopoulos, GUIDED LOCAL SEARCH WITH SHIFTING BOTTLENECK FOR JOB-SHOP SCHEDULING, Management science, 44(2), 1998, pp. 262-275
Citation: E. Balas et J. Xue, WEIGHTED AND UNWEIGHTED MAXIMUM CLIQUE ALGORITHMS WITH UPPER-BOUNDS FROM FRACTIONAL COLORING, Algorithmica, 15(5), 1996, pp. 397-412
Citation: E. Balas et Mc. Carrera, A DYNAMIC SUBGRADIENT-BASED BRANCH-AND-BOUND PROCEDURE FOR SET COVERING, Operations research, 44(6), 1996, pp. 875-890
Citation: E. Balas et al., THE ONE-MACHINE PROBLEM WITH DELAYED PRECEDENCE CONSTRAINTS AND ITS USE IN JOB-SHOP SCHEDULING, Management science, 41(1), 1995, pp. 94-109
Citation: E. Balas et Lq. Qi, LINEAR-TIME SEPARATION ALGORITHMS FOR THE 3-INDEX ASSIGNMENT POLYTOPE, Discrete applied mathematics, 43(1), 1993, pp. 1-12
Citation: E. Balas et M. Fischetti, A LIFTING PROCEDURE FOR THE ASYMMETRIC TRAVELING SALESMAN POLYTOPE AND A LARGE NEW CLASS OF FACETS, Mathematical programming, 58(3), 1993, pp. 325-352