AAAAAA

   
Results: 1-18 |
Results: 18
PROBABILISTIC ANALYSES AND PRACTICAL ALGORITHMS FOR INVENTORY-ROUTINGMODELS
Authors: CHAN LMA FEDERGRUEN A SIMCHILEVI D
Citation: Lma. Chan et al., PROBABILISTIC ANALYSES AND PRACTICAL ALGORITHMS FOR INVENTORY-ROUTINGMODELS, Operations research, 46(1), 1998, pp. 96-106
WORST-CASE ANALYSES, LINEAR-PROGRAMMING AND THE BIN-PACKING PROBLEM
Authors: CHAN LMA SIMCHILEVI D BRAMEL J
Citation: Lma. Chan et al., WORST-CASE ANALYSES, LINEAR-PROGRAMMING AND THE BIN-PACKING PROBLEM, Mathematical programming, 83(2), 1998, pp. 213-227
AVERAGE-CASE ANALYSIS OF THE BIN-PACKING PROBLEM WITH GENERAL COST STRUCTURES
Authors: BRAMEL J RHEE WT SIMCHILEVI D
Citation: J. Bramel et al., AVERAGE-CASE ANALYSIS OF THE BIN-PACKING PROBLEM WITH GENERAL COST STRUCTURES, Naval research logistics, 44(7), 1997, pp. 673-686
A COMPUTERIZED APPROACH TO THE NEW-YORK-CITY SCHOOL BUS ROUTING PROBLEM
Authors: BRACA J BRAMEL J POSNER B SIMCHILEVI D
Citation: J. Braca et al., A COMPUTERIZED APPROACH TO THE NEW-YORK-CITY SCHOOL BUS ROUTING PROBLEM, IIE transactions, 29(8), 1997, pp. 693-702
ON THE EFFECTIVENESS OF SET COVERING FORMULATIONS FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS
Authors: BRAMEL J SIMCHILEVI D
Citation: J. Bramel et D. Simchilevi, ON THE EFFECTIVENESS OF SET COVERING FORMULATIONS FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS, Operations research, 45(2), 1997, pp. 295-301
SINGLE RESOURCE MULTIITEM INVENTORY SYSTEMS
Authors: GALLEGO G QUEYRANNE M SIMCHILEVI D
Citation: G. Gallego et al., SINGLE RESOURCE MULTIITEM INVENTORY SYSTEMS, Operations research, 44(4), 1996, pp. 580-595
PROBABILISTIC ANALYSES AND PRACTICAL ALGORITHMS FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS
Authors: BRAMEL J SIMCHILEVI D
Citation: J. Bramel et D. Simchilevi, PROBABILISTIC ANALYSES AND PRACTICAL ALGORITHMS FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS, Operations research, 44(3), 1996, pp. 501-509
TRANSPORTATION
Authors: SIMCHILEVI D
Citation: D. Simchilevi, TRANSPORTATION, Operations research, 44(2), 1996, pp. 251-252
A NEW-GENERATION OF VEHICLE-ROUTING RESEARCH - ROBUST ALGORITHMS, ADDRESSING UNCERTAINTY
Authors: BERTSIMAS DJ SIMCHILEVI D
Citation: Dj. Bertsimas et D. Simchilevi, A NEW-GENERATION OF VEHICLE-ROUTING RESEARCH - ROBUST ALGORITHMS, ADDRESSING UNCERTAINTY, Operations research, 44(2), 1996, pp. 286-304
ROUTING IN A LINEAR LIGHTWAVE NETWORK
Authors: BALA K STERN TE SIMCHILEVI D BALA K
Citation: K. Bala et al., ROUTING IN A LINEAR LIGHTWAVE NETWORK, IEEE/ACM transactions on networking, 3(4), 1995, pp. 459-469
A LOCATION BASED HEURISTIC FOR GENERAL ROUTING-PROBLEMS
Authors: BRAMEL J SIMCHILEVI D
Citation: J. Bramel et D. Simchilevi, A LOCATION BASED HEURISTIC FOR GENERAL ROUTING-PROBLEMS, Operations research, 43(4), 1995, pp. 649-660
PROBABILISTIC A-PRIORI ROUTING-LOCATION PROBLEMS
Authors: AVERBAKH I BERMAN O SIMCHILEVI D
Citation: I. Averbakh et al., PROBABILISTIC A-PRIORI ROUTING-LOCATION PROBLEMS, Naval research logistics, 41(7), 1994, pp. 973-989
NEW WORST-CASE RESULTS FOR THE BIN-PACKING PROBLEM
Authors: SIMCHILEVI D
Citation: D. Simchilevi, NEW WORST-CASE RESULTS FOR THE BIN-PACKING PROBLEM, Naval research logistics, 41(4), 1994, pp. 579-585
WORST-CASE ANALYSIS OF HEURISTICS FOR THE BIN PACKING PROBLEM WITH GENERAL COST STRUCTURES
Authors: ANILY S BRAMEL J SIMCHILEVI D
Citation: S. Anily et al., WORST-CASE ANALYSIS OF HEURISTICS FOR THE BIN PACKING PROBLEM WITH GENERAL COST STRUCTURES, Operations research, 42(2), 1994, pp. 287-298
REJOINDER TO A NOTE ON BOUNDS FOR DIRECT SHIPPING COSTS
Authors: GALLEGO G SIMCHILEVI D
Citation: G. Gallego et D. Simchilevi, REJOINDER TO A NOTE ON BOUNDS FOR DIRECT SHIPPING COSTS, Management science, 40(10), 1994, pp. 1393-1393
A PROBABILISTIC ANALYSIS OF TOUR PARTITIONING HEURISTICS FOR THE CAPACITATED VEHICLE-ROUTING PROBLEM WITH UNSPLIT DEMANDS
Authors: BIENSTOCK D BRAMEL J SIMCHILEVI D
Citation: D. Bienstock et al., A PROBABILISTIC ANALYSIS OF TOUR PARTITIONING HEURISTICS FOR THE CAPACITATED VEHICLE-ROUTING PROBLEM WITH UNSPLIT DEMANDS, Mathematics of operations research, 18(4), 1993, pp. 786-802
A NOTE ON THE PRIZE COLLECTING TRAVELING SALESMAN PROBLEM
Authors: BIENSTOCK D GOEMANS MX SIMCHILEVI D WILLIAMSON D
Citation: D. Bienstock et al., A NOTE ON THE PRIZE COLLECTING TRAVELING SALESMAN PROBLEM, Mathematical programming, 59(3), 1993, pp. 413-420
HIERARCHICAL PLANNING FOR PROBABILISTIC DISTRIBUTION-SYSTEMS IN EUCLIDEAN SPACES
Authors: SIMCHILEVI D
Citation: D. Simchilevi, HIERARCHICAL PLANNING FOR PROBABILISTIC DISTRIBUTION-SYSTEMS IN EUCLIDEAN SPACES, Management science, 38(2), 1992, pp. 198-211
Risultati: 1-18 |