David Simchi-Levi

PUBLICATIONS:

• Berman O. and D. Simchi-Levi (1986), Minsum Location of a Traveling Salesman. Networks, 16, pp. 239 -254.
• Simchi-Levi, D. and O. Berman (1987), Heuristics and Bounds for the Traveling Salesman Location Problem on the Plane. Operations Research Letters, 6, pp. 243 -248.
• Simchi-Levi, D. and O. Berman (1988), A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks. Operations Research, 36, pp. 478 -474.
• Berman, O. and D. Simchi-Levi (1988), Finding the Optimal A Priori Tour and Location of a Traveling salesman with Non Homogeneous Customers. Transportation Science, 22, pp. 148 -154.
• Berman, O., D. Simchi-Levi and A. Tamir (1988), The Minimax Multistop Location Problem on a Tree. Networks, 18, pp. 39 -49.
• Berman, O. and D. Simchi-Levi (1988), Minisum Location of a Traveling Salesman on Simple Networks. European Journal of Operations Research, 36, pp. 241 -250.
• Berman, O. and D. Simchi-Levi (1989), The Traveling Salesman Location Problem on Stochastic Networks. Transportation Science, 23, pp. 54 -57.
• Li, C. L., S. T. McCormick and D. Simchi-Levi (1990), The Complexity of Finding Two Disjoint Paths with Min Max Objective Function. Discrete Applied Mathematics, 26, pp. 105 -115.
• Henig, M. I. and D. Simchi-Levi (1990), Scheduling Tasks with Failure Probabilities to Minimize Expected Cost. Naval Research Logistics, 37 pp. 99 -109.
• Gallego, G. and D. Simchi-Levi (1990), On the Effectiveness of Direct Shipping Strategy for the One Warehouse Multi-Retailer R-Systems. Management Science, 36, pp. 240 -243.
• Berman, O. and D. Simchi-Levi (1990), Conditional Location Problems on Networks. Transportation Science, 24, pp. 77 -78.
• Li, C. L. and D. Simchi-Levi (1990), Worst-Case Analysis of Heuristics for the Multi-Depot Capacitated Vehicle Routing Problems. ORSA J. on Computing, 2, pp. 64 -73.
• Simchi-Levi, D. and O. Berman (1990), Optimal Locations and Districts of Two Traveling Salesman in a Tree. Networks, 20, pp. 803 -815.
• Drezner, Z., S. Schaible and D. Simchi-Levi (1990), A Queueing-Location Problem on the Plane. Naval Research Logistics, 37, pp. 929 -935.
• Simchi-Levi, D. (1991), The Capacitated Traveling Salesman Location Problem. Transportation Science, 25, pp. 9 -18.
• Simchi-Levi, D. and O. Berman (1991), Minimizing the Total Flow Time of n Jobs on a Network. IIE Transactions, 23, pp. 236 -244.
• Gallego, G., I. Moon and D. Simchi-Levi (1991), Controllable Production Rates in a Family Production Context. International J. of Production Research, 29, pp. 2459 -2470.
• Simchi-Levi, D. (1992), Hierarchical Design for Probabilistic Distribution Systems in Euclidean Spaces. Management Science, 38, pp. 198 -211.
• Li, C. L., S. T. McCormick and D. Simchi-Levi (1992), The Point-to-Point Delivery and Connection Problems: Complexity and Algorithms. Discrete Applied Mathematics, 36, pp. 267 -292.
• Gavish, B., C. L. Li and D. Simchi-Levi (1992), Analysis of Heuristics for the Design of Tree Networks. Annals of Operations Research, 36, pp. 77 -86.
• Li, C. L., D. Simchi-Levi and M. Desrochers (1992), On the Distance Constrained Vehicle Routing Problem. Operations Research, 40, pp. 790 -800.
• Li, C. L., S. T. McCormick and D. Simchi-Levi (1992), On the Minimum-Cost-Bounded Diameter and the Fixed-Budget-Minimum-Diameter Edge Addition Problems. Operations Research Letters, 11, pp. 303 -308.
• Gallego, G., D. Simchi-Levi and D. Xiao (1992), The Complexity of the Staggering Problem and Other Classical Inventory Problems. Operations Research Letters, 12, pp. 47 -52.
• Bramel, J., E. G. Coffman, Jr., P. W. Shor and D. Simchi-Levi (1992), Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Operations Research, 40, pp. 1095 -1106.
• Li, C. L., S. T. McCormick and D. Simchi-Levi (1992), Finding Disjoint Paths with Different Paths - Costs: Complexity and Algorithms. Networks, 22, pp. 653 -667.
• Sigman, K. and D. Simchi-Levi (1992), Light Traffic Heuristic for an M/G/1 Queue with Limited Inventory. Annals of Operations Research, 40, pp. 371 -380.
• Drezner, Z. and D. Simchi-Levi (1992), Asymptotic Behavior of the Weber Location Problem on the Plane. Annals of Operations Research, 40, pp. 163 -172.
• Bienstock, D., M. Goemans, D. Simchi-Levi and D. Williamson (1993), A Note on the Prize Collecting Traveling Salesman Problem. Mathematical Programming, 59, pp. 413 -420.
• Bienstock, D., J. Bramel and D. Simchi-Levi (1993), A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Mathematics of Operations Research, 18, pp. 786 -802.
• Bramel, J., C. L. Li and D. Simchi-Levi (1993), Probabilistic Analysis of Heuristics for the Vehicle Routing with Time Windows. American Journal of Mathematical and Management Sciences, 13, pp. 267-322.
• Anily, S., J. Bramel and D. Simchi-Levi (1994), Worst-Case Analysis of Heuristics for the Bin-Packing Problem with General Cost Structure. Operations Research, 42, pp. 287 -298.
• Simchi-Levi, D. (1994), New Worst Case Results for the Bin-Packing Problem. Naval Research Logistics, 41, pp. 579-585.
• Gallego, G. and D. Simchi-Levi (1994), Rejoinder to "A Note on Bounds for Direct Shipping." Management Science, 40, pp. 1393.
• Averbakh, I., O. Berman and D. Simchi-Levi (1994), Probabilistic a Priori Routing Location Problems. Naval Research Logistics, 41, pp. 973 -989.
• Bala, K., T. E. Stern, D. Simchi-Levi and K. Bala (1994), Routing in Linear Lightwave Networks. IEEE/ACM Transactions on Networking, 3 , pp. 459 -469.
• Bertsimas, D. and D. Simchi-Levi (1994), The New Generation of Vehicle Routing Research: Robust Algorithms Addressing Uncertainty. Operations Research, 44 , pp. 286-304.
• Federgruen, A. and D. Simchi-Levi (1995), Analytical Analysis of Vehicle Routing and Inventory Routing problems. Handbooks in Operations Research and Management Science, the volume on { sl Network Routing. M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds., North-Holland, Amsterdam, pp. 297-373
• Berman, O., P. Jaillet and D. Simchi-Levi (1995), Location-Routing Problems with Uncertainty. Facilities Location, Z. Drezner edt., Springer Verlag pp.\ 427--452.
• Bramel, J. and D. Simchi-Levi (1995), A Location Based Heuristic for General Routing Problems. Operations Research, 43 , pp. 649 -660.
• Pinedo, M. and D. Simchi-Levi (1996), Heuristics Methods: Applications to Facility Layout, Routing and Scheduling. Mathematical Programming for Industrial Engineers, M. Avreil and B. Golany (eds.) Marcel Dekker, Inc., NY, pp. 575 -617.
• Bramel, J. and D. Simchi-Levi (1996), Probabilistic Analysis and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Operations Research, 44 , pp. 501 -509.
• Gallego, G., M. Queyranne and D. Simchi-Levi (1996), Single Resource Multi-Item Multi-Item Inventory System. Operations Research, 44, pp. 580--595.
• Bramel, J. and D, Simchi-Levi (1997), On the Effectiveness of Set Partitioning Formulations for the Vehicle Routing Problem. Operations Research, 45, pp. 295--301.
• Bramel, J., W. T. Rhee and D. Simchi-Levi (1997), Average Case Analysis of the Bin-Packing Problem with General Cost Structure. Naval Research Logistics, 44, pp. 673--686.
• Braca, J., J. Bramel, B. Posner and D, Simchi-Levi (1997), A Computerized Approach to the New York City School Bus Routing Problem. IIE Transactions, 29, pp. 693--702.
• Chan, L. M. A., A. Federgruen and D. Simchi-Levi (1998), Probabilistic Analysis and Practical Algorithms for Inventory Routing Models. Operations Research, 46, pp. 96--106.
• Chan, L. M. A., A. Muriel and D. Simchi-Levi (1998), Parallel Machine Scheduling, Linear Programming and List Scheduling Heuristics. Operations Research, 46, pp. 729--741.
• Kaminsky, P. and D. Simchi-Levi (1998), Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem. Operations Research, 46, pp. 872--882.
• Chan, L. M. A. and D. Simchi-Levi (1998), Probabilistic Analysis and Practical Algorithms for Three-Level Distribution Models. Management Science, 44, pp. 1562--1576.
• Kaminsky, P. and D. Simchi-Levi (1998), A New Computerized Beer Game: Teaching the Value of Integrated Supply Chain Management. Supply Chain and Technology Management. Hau Lee and Shu Ming Ng, eds., POMS Series in Technology and Operations Management, Volume 1, pp. 216--225.
• Chan, L. M. A., D. Simchi-Levi and J. Bramel (1998), Worst-case Analyses, Linear Programming and the Bin-packing Problem. Mathematical Programming 83, pp. 213--227.
• Chen, Y. F., Z. Drezner, J. K. Ryan and D. Simchi-Levi (1998), The Bullwhip Effect: Managerial Insights on the Impact of Forecasting and Information on Variability in a Supply Chain. Quantitative Models for Supply Chain Management, S. Tayur, R. Ganeshan and M. Magazine, (eds.)Kluwer, pp. 417--439.
• Chopra, S. and D. Simchi-Levi (1999), Packing and Covering. CRC Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen et al. (eds.) CRC Press, Boca Raton, FL, pp. 996-1006.
• Chopra, S. and D. Simchi-Levi (1999), Communication Networks. CRC Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen et al. (eds.) CRC Press, Boca Raton, FL, pp. 683-692.
• Chen, Y. F., Z. Drezner, J. K. Ryan and D. Simchi-Levi (2000), Quantifying the Bullwhip Effect in a Simple Supply Chain: The Impact of Forecasting, Lead Times and Information. Management Science 46 pp. 436-443.
• Chen, Y. F., J. K. Ryan and D. Simchi-Levi (2000), The Impact of Exponential Smoothing Forecasts on the Bullwhip Effect. Naval Research Logistics 47 pp. 269-286.
• Gallego, G., J. K. Ryan and D. Simchi-Levi (2000), Minimax Analysis for the Discrete Finite Horizon Inventory Model. IIE Transactions October 2000, pp. 861-874.
• Kaminsky, P. and D. Simchi-Levi (2001), The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem. Operations Research 49 pp. 293-304.
• E. K. Demir, T. Leong, C. L. Li, J. Ng, and D. Simchi-Levi (2001), Locating Containers in a Mega Terminal. Naval Research Logistics 48 pp. 363-385.
• Chou, C. F., M. Queyranne and D. Simchi-Levi (2001), The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. Proceeding of the 8th International IPCO Conference Utrecht, The Netherlands, pp. 45-59.
• Simchi-Levi, D. and E. Simchi-Levi (2001), Logistics Systems Modeling. Handbook of Industrial Engineering, 3rd edition, edited by G. Salvendy and published by John Wiley Sons, pp. 2007-2019.
• Bramel, J. and D. Simchi-Levi (2002), Set Covering Based Algorithms for the Capacitated VRP. The Vehicle Routing Problem, P. Toth and D. Vigo, eds., SIAM Series of Monographs on Discrete Mathematics and Applications, pp. 85--106.
• Kaminsky, P. and D. Simchi-Levi, Probabilistic Analysis of an On-Line Algorithm for the Single Machine Completion Time Problem With Release Dates. To appear in Operations Research Letters.
• Chan, L. M. A., A. Muriel, Z. J. Shen and D. Simchi-Levi, On the Effectiveness of the Zero-Inventory-Ordering Policy for the Economic Lot Sizing Model with Piecewise Linear Cost Structures. To appear in Operations Research.

SUBMITTED FOR PUBLICATION:

• Chan, L. M. A., A. Muriel and D. Simchi-Levi, Supply Chain Management: Integrating Inventory and Transportation. Revised for Operations Research.
• Bramel, J., L. M. A. Chan and D. Simchi-Levi, Worst-Case Analysis of the Modified LPT Heuristic for the Two-Machine Makespan Problem with Capacity Constraints. Submitted to Discrete Applied Mathematics.
• Chen Y. F., Y. Feng and D. Simchi-Levi, Evaluating the Supplier's Performance in a Multiple Retailer System with Interdependent Demands. Submitted to Management Science}.
• Chen Y. F., Y. Feng and D. Simchi-Levi, Exact Evaluation of Order Fulfillment in Multi-Item Inventory Systems with Lot-Size Reorder Point Policies. Submitted to Management Science.
• Y.F. Chen, E. K. Demir, T. Leong, B. L. Nelson, J. Ng, and D. Simchi-Levi, Dispatching Vehicles in a Mega Container Terminal. Submitted to IIE Transactions.
• Chen Y. F., Y. Feng and D. Simchi-Levi, Uniform Distribution of Inventory Positions in Two Level Systems with Independent Demands and Batch Ordering Policies. Under revision.
• Bienstock, D., Q. Deng and D. Simchi-Levi, A Branch-and-Cut Algorithm for the Capacitated Minimum Spanning Tree Problem. Under revision.
• Deng, Q. and D. Simchi-Levi (1992), Valid Inequalities, Facets and Computational Results for the Capacitated Concentrator Location Problem. Under revision.

WORKING PAPERS:

• Simchi-Levi, D. and J. Bramel, Probabilistic Analysis of Heuristics for the Capacitated Vehicle Routing with Unsplit Demands. Working paper, Columbia University.
• Simchi-Levi, D. and J. Bramel, On the Optimal Solution Value of the Capacitated Vehicle Routing Problem with Unsplit Demands. Working paper, Columbia University.
• Piersma, N. and D. Simchi-Levi, Probabilistic Analysis of the Bin-Packing Problem with Empirical Processes. Working paper, Columbia University.

BOOK REVIEW:

• A review on the book: Production and Operations Analysis, by Steven Nahmias. Interfaces, 20, pp. 178 -179, (1990).

Return to David Simchi-Levi Main Homepage.

Last Update: March 20, 1997