search query: @author Gavish, B. / total: 16
references: 5-14 / 16
« previous page | next page »
 titleyearauthor
5.
Parallel savings based heuristic for the delivery problem.
Operations Research
1991 : MAY-JUN, VOL. 39:3, p. 456-469
 1991 Altinkemer, K.
Gavish, B.
6.
A fully polynomial approximation scheme for single product scheduling in a finite capacity facility.
Operations Research
1990 : JAN-FEB, VOL. 38:1, p. 70-83
 1990 Gavish, B.
Johnson, R. E.
7.
Heuristics with constant error guarantees for the design of tree networks.
Management Science
1988 : MAR, VOL. 34:3, p. 331-341
 1988 Altinkemer, K.
Gavish, B.
8.
An optimal solution method for large-scale multiple travelling salesmen problems.
Operations Research
1986 : SEP-OCT, VOL. 34:5, p. 698-717
 1986 Gavish, B.
Srikanth, K.
9.
Optimal lot-sizing algorithms for complex product structures.
Operations Research
1986 : MAR-APR, VOL. 34:2, p. 237-249
 1986 Afentakis, P.
Gavish, B.
10.
E-Approximations for multidimentional weighted location problems.
Operations Research
1985 : JUL-AUG, VOL. 33:4, p. 772-783
 1985 Drezner, Z.
Gavish, B.
11.
Zero-one integer programs with few constraints - Efficient branch and bound algorithms.
European Journal of Operational Research
1985 : OCT, VOL. 22:1, p. 35-43
 1985 Gavish, B.
Pirkul, H.
12.
Zero-one integer programs with few constraints - Lower bounding theory.
European Journal of Operational Research
1985 : AUG, VOL. 21:2, p. 213-224
 1985 Gavish, B.
Pirkul, H.
13.
Computationally efficient optimal solutions to the lot-sizing problem in multistage assembly systems.
Management Science
1984 : FEB, VOL. 30:2, p. 222-239
 1984 Afentakis, P.
Gavish, B.
Karmarkar, U.
14.
An approach to the optimal positioning of a new product.
Management Science
1983 : NOV, VOL. 29:11, p. 1277-1297
 1983 Gavish, B.
Horsky, D.
Srikanth, K.
« previous page | next page »
SCIMA