AAAAAA
Results:
1-17
|
Results: 17
Authors:
BALAS E
OOSTEN M
Citation: E. Balas et M. Oosten, ON THE DIMENSION OF PROJECTED POLYHEDRA, Discrete applied mathematics, 87(1-3), 1998, pp. 1-9
Authors:
BALAS E
LANCIA G
SERAFINI P
VAZACOPOULOS A
Citation: E. Balas et al., JOB-SHOP SCHEDULING WITH DEADLINES, Journal of combinatorial optimization, 1(4), 1998, pp. 329-353
Authors:
BALAS E
NIEHAUS W
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
Authors:
BALAS E
Citation: E. Balas, PROJECTION WITH A MINIMAL SYSTEM OF INEQUALITIES, COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 10(2), 1998, pp. 189-193
Authors:
BALAS E
VAZACOPOULOS A
Citation: E. Balas et A. Vazacopoulos, GUIDED LOCAL SEARCH WITH SHIFTING BOTTLENECK FOR JOB-SHOP SCHEDULING, Management science, 44(2), 1998, pp. 262-275
Authors:
BALAS E
Citation: E. Balas, A MODIFIED LIFT-AND-PROJECT PROCEDURE, Mathematical programming, 79(1-3), 1997, pp. 19-31
Authors:
BALAS E
FISCHETTI M
Citation: E. Balas et M. Fischetti, ON THE MONOTONIZATION OF POLYHEDRA, Mathematical programming, 78(1), 1997, pp. 59-84
Authors:
BALAS E
XUE J
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
Authors:
BALAS E
CERIA S
CORNUEJOLS G
NATRAJ N
Citation: E. Balas et al., GOMORY CUTS REVISITED, Operations research letters, 19(1), 1996, pp. 1-9
Authors:
BALAS E
CARRERA MC
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
Authors:
BALAS E
CERIA S
CORNUEJOLS G
Citation: E. Balas et al., MIXED-0-1 PROGRAMMING BY LIFT-AND-PROJECT IN A BRANCH-AND-CUT FRAMEWORK, Management science, 42(9), 1996, pp. 1229-1246
Authors:
BALAS E
Citation: E. Balas, THE PRIZE COLLECTING TRAVELING SALESMAN PROBLEM .2. POLYHEDRAL RESULTS, Networks, 25(4), 1995, pp. 199-216
Authors:
BALAS E
FISCHETTI M
PULLEYBLANK WR
Citation: E. Balas et al., THE PRECEDENCE-CONSTRAINED ASYMMETRIC TRAVELING SALESMAN POLYTOPE, Mathematical programming, 68(3), 1995, pp. 241-265
Authors:
BALAS E
LENSTRA JK
VAZACOPOULOS A
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
Authors:
BALAS E
QI LQ
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
Authors:
BALAS E
CERIA S
CORNUEJOLS G
Citation: E. Balas et al., A LIFT-AND-PROJECT CUTTING PLANE ALGORITHM FOR MIXED 0-1 PROGRAMS, Mathematical programming, 58(3), 1993, pp. 295-324
Authors:
BALAS E
FISCHETTI M
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
Risultati:
1-17
|