Sunil Chopra
Research Page

Papers Published or Accepted for Publication

[1] "Dual Row Modules and Polyhedra of Blocking Group Problems," with E. L. Johnson, Mathematical Programming, 38 (1987), 229-270.
[2] "Polyhedra of regular p-nary group problems," with D. L. Jensen and E. L. Johnson, Mathematical Programming 43 (1989) 1-29.
[3] "On Ternary Problems," Mathematical Programming, 45 (1989), 35-47.
[4] "On the Spanning Tree Polyhedron," Operations Research Letters 8 (1989) 25-29.
[5] "The Graphical Asymmetric Traveling Salesman Polyhedron," with G. Rinaldi, Proceedings of Integer Programming and Combinatorial Optimization Conference, Waterloo, May 1990, R. Kannan and W. R. Pulleyblank (eds.), 129-145.
[6] "On the Multiway Cut Polyhedron," with M. R. Rao, Networks 21 (1991), 51-89.
[7] "The Partition Problem," with M. R. Rao, Mathematical Programming, 59 (1993), 87-115.
[8] "Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems," SIAM Journal on Discrete Mathematics 5, No. 3 (1992), 321-337.
[9] "The Equivalent Subgraph Polyhedron on Series-parallel Graphs," SIAM Journal on Discrete Mathematics 5, No. 4 (1992), 475-490.
[10] "Solving a Steiner Tree Problem on a Graph Using Branch and Cut," with E. Gorres and M. R. Rao, ORSA Journal on Computing, 4 (1992), 320-335.
[11] "The k-edge Connected Spanning Subgraph Polyhedron," SIAM Journal on Discrete Mathematics; also appeared in Proceedings of IPCO92.
[12] "The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs," SIAM Journal on Discrete Mathematics, 7, No. 1 (1994), 16-31.
[13] "The Steiner Tree problem I: Formulations, Compositions and Extensions of Facets," with M.R. Rao, Mathematical Programming, 64 (1994), 209-229.
[14] "The Steiner Tree Problem II: Properties and Classes of Facets," with M.R. Rao, Mathematical Programming, 64 (1994), 231-246.
[15] "Comparison of Formulations and a Heuristic for Packing Steiner Trees in a Graph," Annals of Operations Research, 50 (1994), 143-171.
[16] "Facets of the k-partition Polytope" (with M. R. Rao), Discrete Applied Mathematics, 61 (1995), 27-48.
[17] "Compositions for Matroids with the Fulkerson Property," Annals of Operations Research, 62 (1995), 87-101.
[18] "The Graphical Traveling Salesman Polyhedron: Symmetric Inequalities," SIAM Journal on Discrete Mathematics, Vol. 9, No. 4 (1996), 602-624.
[19] "Minimum Cost Node Disjoint Steiner Trees in Series-Parallel Networks" (with K. Talluri), VLSI Design, 4 (1), 1996, 53-57.
[20] "An Extended Formulation for the A-cut Problem," with J. Owen, Mathematical Programming, 73 (1996), 7-30.
[21] "Minimum Cost Capacity Installations for Multicommodity Network Flows" (with D. Bienstock, O. Gunluk, and C. Y. Tsai), Mathematical Programming 81 (1998) 177-199.
[22] "Algorithms and Extended Formulations for One and Two Facility Network Design," with I. Gilboa and S.T. Sastry, Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, 1094 Springer-Verlag, 1996.
[23] "Computational Study of the Multi-echelon Production Planning Problem," with M. R. Rao and C. Y. Tsai, Naval Research Logistics Quarterly.
[24] "Source sink flows with capacity installation in batches," with I. Gilboa and S.T. Sastry, Discrete Applied Mathematics, 85 (1998) 165-192.
[25] "Partitioning of hypergraphs," with J. Owen, Discrete Applied Mathematics, 90 (1999) 115-133.
[26] "Packing and Covering," (with D. Simchi-Levi), CRC Handbook of Discrete and Combinatorial Mathematics 2000.
[27] "Communication Networks," (with D. Simchi-Levi), CRC Handbook of Discrete and Combinatorial Mathematics, 2000.
[28] "Which e-business is right for your supply chain?" (with J. Van Mieghem) Supply Chain Management Review, July-August 2000.
[29] "A branch-and-cut approach for minimum cost multi-level network design" (with C.Y. Tsai) Discrete Mathematics 242 (2002) 65-92
[30] "Evaluating B2B e-commerce opportunities in a supply chain," Supply Chain Management Review, May-June 2001
[31] "Polyhedral Approaches for the Steiner Tree Problem on Graphs," (with C. Y. Tsai) Steiner Trees in Industry, D.Z. Du and X. Cheng (eds.), Kluwer Publishers (2001)
[32] "Cost Allocation for a Tree Network with Heterogeneous Customers," (with D. Granot and J. Kuipers) Mathematics of Operations Research, 27 (2002) 647-661.
[33] "What Will Drive the Enterprise Software Shakeout?," (with P. Meindl) Supply Chain Management Review (January-February 2003) 50-56.
[34] "Designing the Delivery Network for a Supply Chain," Transportation Research, 39 (2003) 123-140. A revised version of this paper has also appeared in Boletin De Estudios Economicos, Universidad Comercial De Deusto.
[35] "Coal Movement by Railroad in the Powder River Basin," (with G. Reinhardt and M. Dada), Energy Studies Review, Vol. 11, No. 1, 2003 pp 53-73.
[36] "The Effect of Lead Time Uncertainty on Safety Stocks," (with G. Reinhardt and M. Dada), Decision Sciences 35 (1), 2004, 1-20.
[37] "Five Decades of Operations Management and the Prospects Ahead," (with W. Lovejoy and C. Yano), Management Science 50 (1), 2004, 8-14.
[38] "Managing Risk to Avoid Supply Chain Breakdown," (with M.S. Sodhi), Sloan Management Review (Fall 2004).
[39] "Managing Service Inventory to Improve Performance," (with M. Lariviere), Sloan Management Review (Fall 2005)
[40] "The Importance of Decoupling Disruption and recurrent Risk in a Supply Chain," (with U. Mohan and G. Reinhardt), to appear in Naval Research Logistics.
[41] "Simple standardized patient hand-off system that increases accuracy and completeness," (with Wayne J., Tyagi R., Reinhardt G, Rooney D, Makoul G, DaRosa D), Journal of Surgical Education VOlume 65, Number 1, January/February 2008.

Books (Author or Co-Author)

[1] Managing Business Process Flows, (with R. Anupindi, S. Deshmukh, J, Van Mieghem, E. Zemel), Prentice Hall 1st edition, 1999; 2nd edition 2005.
[2] Supply Chain Management: Strategy, Planning, and Operation, (with P. Meindl), Prentice Hall, 1st edition, 2001; 2nd edition 2004.

Books (Edited)

[1] 35 Years of MEDS and Management Theory, with A. Raviv and R. Vohra, 2003.

Other Articles

[1] "Choose the Channel that Matches Your Product," Supply Chain Strategy, Vol. 2, No. 9, October 2006.

Working Papers
[1] "Maximum Value Job Shop Scheduling," with M. Guignard and N. G. Hall.
[2] "On the Node Weighted Steiner Tree Problem," with C.Y. Tsai and E. Gorres.
[3] "Minimum Cuts in Hypergraphs."
[4] "Flat Graphs: A Self Dual Class of Planar Graphs," with E. L. Johnson.
[5] "A Polynomial Time Version of the Affine Scaling Algorithm," with E. R. Barnes and D. L. Jensen.
[6] "Impact of stair-step incentives and dealer structures on manufacturers sales variance," with M. Sohoni, U. Mohan, and M.N. Sendil.
[7] "Revenue Cycle Management at Evnaston Northwestern Healthcare: Using lean principles to Improve Performance," With J. Golbus, D. Kirkorsky, and G. Reinhardt.