Authors: Averbakh, I

Citation: I. Averbakh, On the complexity of a class of combinatorial optimization problems with uncertainty, MATH PROGR, 90(2), 2001, pp. 263-272

Authors: Averbakh, I Berman, O

Citation: I. Averbakh et O. Berman, Minmax regret median location on a network under uncertainty, INFORMS J C, 12(2), 2000, pp. 104-110

Authors: Averbakh, I

Citation: I. Averbakh, Minmax regret solutions for minimax optimization problems with uncertainty, OPER RES L, 27(2), 2000, pp. 57-65

Authors: Averbakh, I Berman, O

Citation: I. Averbakh et O. Berman, Parallel complexity of additive location problems, INFORMS J C, 11(3), 1999, pp. 292-298

Authors: Averbakh, I Berman, O

Citation: I. Averbakh et O. Berman, Algorithms for path medi-centers of a tree, COMPUT OPER, 26(14), 1999, pp. 1395-1409

Authors: Averbakh, I Berman, O

Citation: I. Averbakh et O. Berman, A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems, OPERAT RES, 47(1), 1999, pp. 165-170