Sunil Chopra - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 46 from 46

2023

An Exact Solution Method for the Political Districting ProblemSunil Chopra, Hyunwoo Park, Sangho Shim. ppl, 33(1&2), March & June 2023. [doi]

2022

2021

Achieving supply chain efficiency and resilience by using multi-level commonsSunil Chopra, ManMohan S. Sodhi, Florian Lücker. dsj, 52(4):817-832, 2021. [doi]

2020

Partial Demand Information and Commitment in Dynamic Transportation ProcurementPol Boada-Collado, Sunil Chopra, Karen R. Smilowitz. transci, 54(3):588-605, 2020. [doi]

A strong formulation for the graph partition problemSunil Chopra, Sangho Shim. networks, 75(2):183-202, 2020. [doi]

Managing Disruption Risk Over the Product Life CycleVadim Glinsky, Sunil Chopra, Florian Lücker. fttiom, 14(1-2):101-120, 2020. [doi]

2019

A concise characterization of strong knapsack facetsSunil Chopra, Sangho Shim, Daniel E. Steffy. DAM, 253:136-152, 2019. [doi]

Disruption Risk Management in Serial Multi-Echelon Supply ChainsFlorian Lücker, Sunil Chopra, Ralf W. Seifert. fttiom, 12(2-3):298-315, 2019. [doi]

The Covering Path Problem on a GridLiwei Zeng, Sunil Chopra, Karen R. Smilowitz. transci, 53(6):1656-1672, 2019. [doi]

2017

An extended formulation of the convex recoloring problem on a treeSunil Chopra, Bartosz Filipecki, Kangbok Lee, Minseok Ryu, Sangho Shim, Mathieu Van Vyve. mp, 165(2):529-548, 2017. [doi]

The worst case analysis of strong knapsack facetsSangho Shim, Sunil Chopra, Wenwei Cao. mp, 162(1-2):465-493, 2017. [doi]

2016

Separation Algorithm for Tree Partitioning InequalitiesSunil Chopra, Kangbok Lee, Minseok Ryu, Sangho Shim. endm, 52:109-116, 2016. [doi]

Eco-activities and operating performance in the computer and electronics industrySunil Chopra, Pei-Ju Wu. eor, 248(3):971-981, 2016. [doi]

2013

Facility Location Decisions with Random Disruptions and Imperfect EstimationMichael K. Lim, Achal Bassamboo, Sunil Chopra, Mark S. Daskin. msom, 15(2):239-249, 2013. [doi]

Binary group facets with complete support and non-binary coefficientsYan Shu, Sunil Chopra, Ellis L. Johnson, Sangho Shim. orl, 41(6):679-684, 2013. [doi]

2004

Five Decades of Operations Management and the Prospects AheadSunil Chopra, William S. Lovejoy, Candace Yano. mansci, 50(1):8-14, 2004. [doi]

The Effect of Lead Time Uncertainty on Safety StocksSunil Chopra, Gilles Reinhardt, Maqbool Dada. dsj, 35(1):1-24, 2004. [doi]

2002

A branch-and-cut approach for minimum cost multi-level network designSunil Chopra, Chih-Yang Tsai. DM, 242(1-3):65-92, 2002. [doi]

Cost Allocation for a Tree Network with Heterogeneous CustomersDaniel Granot, Jeroen Kuipers, Sunil Chopra. mor, 27(4):647-661, 2002. [doi]

1999

A Note on Formulations for the A-partition Problem on HypergraphsSunil Chopra, Jonathan H. Owen. DAM, 90(1-3):115-133, 1999. [doi]

1998

Minimum cost capacity installation for multicommodity network flowsDaniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai. mp, 81:177-199, 1998.

Source Sink Flows with Capacity Installation in BatchesSunil Chopra, Itzhak Gilboa, S. Trilochan Sastry. DAM, 85(3):165-192, 1998. [doi]

1996

The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric InequalitiesSunil Chopra, Giovanni Rinaldi. siamdm, 9(4):602-624, 1996. [doi]

Algorithms and Extended Formulations for One and Two Facility Network DesignSunil Chopra, Itzhak Gilboa, S. Trilochan Sastry. ipco 1996: 44-57

Extended formulations for the A-cut problemSunil Chopra, Jonathan H. Owen. mp, 73:7-30, 1996.

Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel NetworksSunil Chopra, Kalyan T. Talluri. vlsi, 4(1):53-57, 1996. [doi]

1995

Compositions for Matroids with the Fulkerson PropertySunil Chopra. DAM, 62(1-3):87-101, 1995. [doi]

Facets of the K-partition PolytopeSunil Chopra, M. R. Rao. DAM, 61(1):27-48, 1995. [doi]

1994

The Steiner tree problem I: Formulations, compositions and extension of facetsSunil Chopra, M. R. Rao. mp, 64:209-229, 1994.

The Steiner tree problem II: Properties and classes of facetsSunil Chopra, M. R. Rao. mp, 64:231-246, 1994.

The k-Edge-Connected Spanning Subgraph PolyhedronSunil Chopra. siamdm, 7(2):245-259, 1994. [doi]

The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free GraphsSunil Chopra. siamdm, 7(1):16-31, 1994. [doi]

Comparison of formulations and a heuristic for packing Steiner trees in a graphSunil Chopra. anor, 50(1):143-171, 1994. [doi]

1993

The partition problemSunil Chopra, M. R. Rao. mp, 59:87-115, 1993.

1992

The K-Edge Connected Spanning Subgraph PolyhedronSunil Chopra. ipco 1992: 15-29

The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel GraphsSunil Chopra. siamdm, 5(4):475-490, 1992.

Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity ProblemsSunil Chopra. siamdm, 5(3):321-337, 1992.

Solving the Steiner Tree Problem on a Graph Using Branch and CutSunil Chopra, Edgar R. Gorres, M. R. Rao. informs, 4(3):320-335, 1992. [doi]

1991

On the multiway cut polyhedronSunil Chopra, M. R. Rao. networks, 21(1):51-89, 1991. [doi]

1990

The Graphical Asymmetric Traveling Salesman PolyhedronSunil Chopra, Giovanni Rinaldi. ipco 1990: 129-145

1989

p-nary group problemsSunil Chopra, David L. Jensen, Ellis L. Johnson. mp, 43(1-3):1-29, 1989. [doi]

On ternary problemsSunil Chopra. mp, 45(1-3):35-47, 1989. [doi]

1987

Dual row modules and polyhedra of blocking group problemsSunil Chopra, Ellis L. Johnson. mp, 38(3):229-270, 1987. [doi]

Sign in or sign up to see more results.

runs on WebDSL