au.\*:("GARFINKEL RS")
Results 1 to 9 of 9
Selection :
MINIMIZING WALLPAPER WASTE. I. A CLASS OF TRAVELING SALESMAN PROBLEMS.GARFINKEL RS.1977; OPER. RES.; U.S.A.; DA. 1977; VOL. 25; NO 5; PP. 741-751; BIBL. 2 REF.Article
ON PARTITIONING THE FEASIBLE SET IN A BRANCH-AND-BOUND ALGORITHM FOR THE ASYMMETRIC TRAVELING-SALESMAN PROBLEMGARFINKEL RS.1973; OPER. RES.; U.S.A.; DA. 1973; VOL. 21; NO 1; PP. 340-343; BIBL. 2 REF.Serial Issue
A SOLVABLE CYCLIC SCHEDULING PROBLEM WITH SERIAL PRECEDENCE STRUCTUREGARFINKEL RS; PLOTNICKI WJ.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 5; PP. 1236-1240; BIBL. 2 REF.Article
LOCATING AN OBNOXIOUS FACILITY ON A NETWORKCHURCH RL; GARFINKEL RS.1978; TRANSPORT. SCI.; USA; DA. 1978; VOL. 12; NO 2; PP. 107-118; BIBL. 4 REF.Article
THE BOTTLENECK TRAVELING SALESMAN PROBLEM: ALGORITHMS AND PROBABILISTIC ANALYSISGARFINKEL RS; GILBERT KC.1978; J. ASS. COMPUTG MACHIN.; USA; DA. 1978; VOL. 25; NO 3; PP. 435-448; BIBL. 17 REF.Article
THE BOTTLENECK TRANSPORTATION PROBLEMGARFINKEL RS; RAO MR.1972; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1972; VOL. 18; NO 4; PP. 465-472; BIBL. 9 REF.Serial Issue
THE GENERALIZED DIAMETER OF A GRAPHCHIH KANG ERIC CHEN; GARFINKEL RS.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 3; PP. 335-340; BIBL. 5 REF.Article
AN ALGORITHM FOR THE M-MEDIAN PLANT LOCATION PROBLEM.GARFINKEL RS; NEEBE AW; RAO MR et al.1974; TRANSPORT. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 3; PP. 217-236; BIBL. 1 P.Article
THE M-CENTER PROBLEM: MINIMAX FACILITY LOCATION.GARFINKEL RS; NEEBE AW; RAD MR et al.1977; MANAG. SCI.; U.S.A.; DA. 1977; VOL. 23; NO 10; PP. 1123-1142; BIBL. 21 REF.Article