AAAAAA
Results:
1-9
|
Results: 9
Authors:
Balas, E
Ivanescu, P L.
Citation: E. Balas, et L. Ivanescu, P, ON THE GENERALIZED TRANSPORTATION PROBLEM, Management science , 11(1), 1964, pp. 188-213
Authors:
Balas, E
Ivanescu, P L.
Citation: E. Balas, et L. Ivanescu, P, ON THE GENERALIZED TRANSPORTATION PROBLEM, Management science , 11(1), 1964, pp. 188-203
Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computational study
Authors:
Balas, E
Simonetti, N
Citation: E. Balas et N. Simonetti, Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computational study, INFORMS J C, 13(1), 2001, pp. 56-75
Authors:
Balas, E
Ceria, S
Dawande, M
Margot, F
Pataki, G
Citation: E. Balas et al., Octane: A new heuristic for pure 0-1 programs, OPERAT RES, 49(2), 2001, pp. 207-225
Authors:
Balas, E
Oosten, M
Citation: E. Balas et M. Oosten, On the cycle polytope of a directed graph, NETWORKS, 36(1), 2000, pp. 34-46
Authors:
Balas, E
Fischetti, M
Citation: E. Balas et M. Fischetti, Lifted cycle inequalities for the asymmetric traveling salesman problem, MATH OPER R, 24(2), 1999, pp. 273-292
Authors:
Balas, E
Citation: E. Balas, New classes of efficiently solvable generalized Traveling Salesman Problems, ANN OPER R, 86, 1999, pp. 529-558
Authors:
Balas, E
Citation: E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, DISCR APP M, 89(1-3), 1998, pp. 3-44
Authors:
Balas, E
Zemel, E
Citation: E. Balas et E. Zemel, Critical cutsets of graphs and canonical facets of set packing polytopes (vol 2, pg 15, 1977), MATH OPER R, 23(4), 1998, pp. 1022-1022
Risultati:
1-9
|