AAAAAA
Results:
1-22
|
Results: 22
Authors:
GUTTMANNBECK N
HASSIN R
Citation: N. Guttmannbeck et R. Hassin, APPROXIMATION ALGORITHMS FOR MINIMUM TREE PARTITION, Discrete applied mathematics, 87(1-3), 1998, pp. 117-137
Authors:
ANILY S
GLASS CA
HASSIN R
Citation: S. Anily et al., THE SCHEDULING OF MAINTENANCE SERVICE, Discrete applied mathematics, 82(1-3), 1998, pp. 27-42
Authors:
GLAZER A
HASSIN R
Citation: A. Glazer et R. Hassin, OPTIMAL ALLOCATION OF QUOTAS, Economics letters, 58(1), 1998, pp. 55-61
Authors:
GLAZER A
HASSIN R
Citation: A. Glazer et R. Hassin, GOVERNMENTAL FAILURES IN EVALUATING PROGRAMS, Public choice, 94(1-2), 1998, pp. 105-115
Authors:
HASSIN R
RUBINSTEIN S
Citation: R. Hassin et S. Rubinstein, AN APPROXIMATION ALGORITHM FOR THE MAXIMUM TRAVELING SALESMAN PROBLEM, Information processing letters, 67(3), 1998, pp. 125-130
Authors:
GUTTMANNBECK N
HASSIN R
Citation: N. Guttmannbeck et R. Hassin, APPROXIMATION ALGORITHMS FOR MIN-MAX TREE PARTITION, Journal of algorithms, 24(2), 1997, pp. 266-286
Authors:
HASSIN R
RUBINSTEIN S
TAMIR A
Citation: R. Hassin et al., APPROXIMATION ALGORITHMS FOR MAXIMUM DISPERSION, Operations research letters, 21(3), 1997, pp. 133-137
Authors:
HASSIN R
HAVIV M
Citation: R. Hassin et M. Haviv, EQUILIBRIUM THRESHOLD STRATEGIES - THE CASE OF QUEUES WITH PRIORITIES, Operations research, 45(6), 1997, pp. 966-973
Authors:
ARKIN EM
HASSIN R
KLEIN L
Citation: Em. Arkin et al., RESTRICTED DELIVERY PROBLEMS ON A NETWORK, Networks, 29(4), 1997, pp. 205-216
Authors:
HASSIN R
RUBINSTEIN S
Citation: R. Hassin et S. Rubinstein, AN APPROXIMATION ALGORITHM FOR MAXIMUM PACKING OF 3-EDGE PATHS, Information processing letters, 63(2), 1997, pp. 63-67
Authors:
HASSIN R
HAVIV M
Citation: R. Hassin et M. Haviv, ON OPTIMAL AND EQUILIBRIUM RETRIAL RATES IN A QUEUING SYSTEM, Probability in the engineering and informational sciences, 10(2), 1996, pp. 223-227
Authors:
HASSIN R
Citation: R. Hassin, A FLOW ALGORITHM FOR NETWORK SYNCHRONIZATION, Operations research, 44(4), 1996, pp. 570-579
Authors:
HASSIN R
Citation: R. Hassin, ON THE ADVANTAGE OF BEING THE FIRST SERVER, Management science, 42(4), 1996, pp. 618-623
Authors:
BENELLI M
HASSIN R
Citation: M. Benelli et R. Hassin, OPTIMAL SEPARABLE PARTITIONING IN THE PLANE, Discrete applied mathematics, 59(3), 1995, pp. 215-224
Authors:
HASSIN R
HAVIV M
Citation: R. Hassin et M. Haviv, EQUILIBRIUM STRATEGIES FOR QUEUES WITH IMPATIENT CUSTOMERS, Operations research letters, 17(1), 1995, pp. 41-45
Authors:
HASSIN R
Citation: R. Hassin, DECENTRALIZED REGULATION OF A QUEUE, Management science, 41(1), 1995, pp. 163-173
Authors:
HASSIN R
TAMIR A
Citation: R. Hassin et A. Tamir, ON THE MINIMUM DIAMETER SPANNING TREE PROBLEM, Information processing letters, 53(2), 1995, pp. 109-111
Authors:
ARKIN EM
HASSIN R
Citation: Em. Arkin et R. Hassin, APPROXIMATION ALGORITHMS FOR THE GEOMETRIC COVERING SALESMAN PROBLEM, Discrete applied mathematics, 55(3), 1994, pp. 197-218
Authors:
HASSIN R
LAHAV S
Citation: R. Hassin et S. Lahav, MAXIMIZING THE NUMBER OF UNUSED COLORS IN THE VERTEX COLORING PROBLEM, Information processing letters, 52(2), 1994, pp. 87-90
Authors:
HASSIN R
RUBINSTEIN S
Citation: R. Hassin et S. Rubinstein, APPROXIMATIONS FOR THE MAXIMUM ACYCLIN SUBGRAPH PROBLEM, Information processing letters, 51(3), 1994, pp. 133-140
Authors:
HASSIN R
HENIG M
Citation: R. Hassin et M. Henig, MONOTONICITY AND EFFICIENT COMPUTATION OF OPTIMAL DICHOTOMOUS SEARCH, Discrete applied mathematics, 46(3), 1993, pp. 221-234
Authors:
ARKIN EM
HALLDORSSON MM
HASSIN R
Citation: Em. Arkin et al., APPROXIMATING THE TREE AND TOUR COVERS OF A GRAPH, Information processing letters, 47(6), 1993, pp. 275-282
Risultati:
1-22
|