default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSunil Chopra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Sunil Chopra, Vadim Glinskiy, Florian Lücker
:
Using anticipatory orders to manage disruption risk over a short product life cycle. Eur. J. Oper. Res. 319(1): 153-167 (2024)- 2023
- [j44]Sunil Chopra, Feng Qiu, Sangho Shim:
Parallel Power System Restoration. INFORMS J. Comput. 35(1): 233-247 (2023) - [j43]Sunil Chopra, Hyunwoo Park, Sangho Shim:
An Exact Solution Method for the Political Districting Problem. Parallel Process. Lett. 33(1&2): 2340001:1-2340001:13 (2023) - 2022
- [j42]Kyungduk Moon, Kangbok Lee, Sunil Chopra, Steve Kwon:
Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy. Eur. J. Oper. Res. 300(2): 743-754 (2022) - [j41]Sunil Chopra, Hyunwoo Park, Sangho Shim:
Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks. INFORMS J. Comput. 34(3): 1327-1344 (2022) - [j40]Pol Boada-Collado, Sunil Chopra, Karen R. Smilowitz:
The Value of Information and Flexibility with Temporal Commitments. Manuf. Serv. Oper. Manag. 24(4): 2098-2115 (2022) - [j39]Liwei Zeng, Sunil Chopra, Karen R. Smilowitz:
A Bounded Formulation for The School Bus Scheduling Problem. Transp. Sci. 56(5): 1148-1164 (2022) - [i3]Sunil Chopra, Feng Qiu, Sangho Shim:
Parallel Power System Restoration. CoRR abs/2204.01837 (2022) - 2021
- [j38]Sunil Chopra, ManMohan S. Sodhi, Florian Lücker:
Achieving supply chain efficiency and resilience by using multi-level commons. Decis. Sci. 52(4): 817-832 (2021) - 2020
- [j37]Vadim Glinsky, Sunil Chopra, Florian Lücker:
Managing Disruption Risk Over the Product Life Cycle. Found. Trends Technol. Inf. Oper. Manag. 14(1-2): 101-120 (2020) - [j36]Sunil Chopra, Sangho Shim:
A strong formulation for the graph partition problem. Networks 75(2): 183-202 (2020) - [j35]Pol Boada-Collado, Sunil Chopra, Karen R. Smilowitz:
Partial Demand Information and Commitment in Dynamic Transportation Procurement. Transp. Sci. 54(3): 588-605 (2020)
2010 – 2019
- 2019
- [j34]Sunil Chopra, Sangho Shim, Daniel E. Steffy:
A concise characterization of strong knapsack facets. Discret. Appl. Math. 253: 136-152 (2019) - [j33]Florian Lücker, Sunil Chopra, Ralf W. Seifert:
Disruption Risk Management in Serial Multi-Echelon Supply Chains. Found. Trends Technol. Inf. Oper. Manag. 12(2-3): 298-315 (2019) - [j32]Liwei Zeng, Sunil Chopra, Karen R. Smilowitz:
The Covering Path Problem on a Grid. Transp. Sci. 53(6): 1656-1672 (2019) - [i2]Liwei Zeng, Karen R. Smilowitz, Sunil Chopra:
Generalizing the Covering Path Problem on a Grid. CoRR abs/1904.12258 (2019) - 2018
- [i1]Liwei Zeng, Sunil Chopra, Karen R. Smilowitz:
A Bounded Formulation for The School Bus Scheduling Problem. CoRR abs/1803.09040 (2018) - 2017
- [j31]Sangho Shim, Sunil Chopra, Wenwei Cao:
The worst case analysis of strong knapsack facets. Math. Program. 162(1-2): 465-493 (2017) - [j30]Sunil Chopra, Bartosz Filipecki, Kangbok Lee, Minseok Ryu, Sangho Shim, Mathieu Van Vyve:
An extended formulation of the convex recoloring problem on a tree. Math. Program. 165(2): 529-548 (2017) - 2016
- [j29]Sunil Chopra, Kangbok Lee, Minseok Ryu, Sangho Shim:
Separation Algorithm for Tree Partitioning Inequalities. Electron. Notes Discret. Math. 52: 109-116 (2016) - [j28]Sunil Chopra, Pei-Ju Wu:
Eco-activities and operating performance in the computer and electronics industry. Eur. J. Oper. Res. 248(3): 971-981 (2016) - 2013
- [j27]Michael K. Lim, Achal Bassamboo, Sunil Chopra, Mark S. Daskin:
Facility Location Decisions with Random Disruptions and Imperfect Estimation. Manuf. Serv. Oper. Manag. 15(2): 239-249 (2013) - [j26]Yan Shu, Sunil Chopra, Ellis L. Johnson, Sangho Shim:
Binary group facets with complete support and non-binary coefficients. Oper. Res. Lett. 41(6): 679-684 (2013)
2000 – 2009
- 2004
- [j25]Sunil Chopra, Gilles Reinhardt, Maqbool Dada:
The Effect of Lead Time Uncertainty on Safety Stocks. Decis. Sci. 35(1): 1-24 (2004) - [j24]Sunil Chopra, William S. Lovejoy, Candace A. Yano:
Five Decades of Operations Management and the Prospects Ahead. Manag. Sci. 50(1): 8-14 (2004) - 2002
- [j23]Sunil Chopra, Chih-Yang Tsai:
A branch-and-cut approach for minimum cost multi-level network design. Discret. Math. 242(1-3): 65-92 (2002) - [j22]Daniel Granot, Jeroen Kuipers, Sunil Chopra:
Cost Allocation for a Tree Network with Heterogeneous Customers. Math. Oper. Res. 27(4): 647-661 (2002)
1990 – 1999
- 1999
- [j21]Sunil Chopra, Jonathan H. Owen:
A Note on Formulations for the A-partition Problem on Hypergraphs. Discret. Appl. Math. 90(1-3): 115-133 (1999) - [r2]Beth Novick, S. Louis Hakimi, Sunil Chopra, David Simchi-Levi, Salah E. Elmaghraby, Michael Mesterton-Gibbons, Joseph R. Barr:
Discrete Optimization. Handbook of Discrete and Combinatorial Mathematics 1999 - [r1]James B. Orlin, Ravindra K. Ahuja, David Simchi-Levi, Sunil Chopra, Bruce L. Golden, B. K. Kaku:
Networks And Flows. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j20]Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry:
Source Sink Flows with Capacity Installation in Batches. Discret. Appl. Math. 85(3): 165-192 (1998) - [j19]Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai:
Minimum cost capacity installation for multicommodity network flows. Math. Program. 81: 177-199 (1998) - 1996
- [j18]Sunil Chopra, Jonathan H. Owen:
Extended formulations for the A-cut problem. Math. Program. 73: 7-30 (1996) - [j17]Sunil Chopra, Giovanni Rinaldi:
The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities. SIAM J. Discret. Math. 9(4): 602-624 (1996) - [j16]Sunil Chopra, Kalyan T. Talluri:
Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel Networks. VLSI Design 4(1): 53-57 (1996) - [c3]Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry:
Algorithms and Extended Formulations for One and Two Facility Network Design. IPCO 1996: 44-57 - 1995
- [j15]Sunil Chopra, M. R. Rao:
Facets of the K-partition Polytope. Discret. Appl. Math. 61(1): 27-48 (1995) - [j14]Sunil Chopra:
Compositions for Matroids with the Fulkerson Property. Discret. Appl. Math. 62(1-3): 87-101 (1995) - 1994
- [j13]Sunil Chopra:
Comparison of formulations and a heuristic for packing Steiner trees in a graph. Ann. Oper. Res. 50(1): 143-171 (1994) - [j12]Sunil Chopra, M. R. Rao:
The Steiner tree problem I: Formulations, compositions and extension of facets. Math. Program. 64: 209-229 (1994) - [j11]Sunil Chopra, M. R. Rao:
The Steiner tree problem II: Properties and classes of facets. Math. Program. 64: 231-246 (1994) - [j10]Sunil Chopra:
The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs. SIAM J. Discret. Math. 7(1): 16-31 (1994) - [j9]Sunil Chopra:
The k-Edge-Connected Spanning Subgraph Polyhedron. SIAM J. Discret. Math. 7(2): 245-259 (1994) - 1993
- [j8]Sunil Chopra, M. R. Rao:
The partition problem. Math. Program. 59: 87-115 (1993) - 1992
- [j7]Sunil Chopra, Edgar R. Gorres, M. R. Rao:
Solving the Steiner Tree Problem on a Graph Using Branch and Cut. INFORMS J. Comput. 4(3): 320-335 (1992) - [j6]Sunil Chopra:
Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems. SIAM J. Discret. Math. 5(3): 321-337 (1992) - [j5]Sunil Chopra:
The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs. SIAM J. Discret. Math. 5(4): 475-490 (1992) - [c2]Sunil Chopra:
The K-Edge Connected Spanning Subgraph Polyhedron. IPCO 1992: 15-29 - 1991
- [j4]Sunil Chopra, M. R. Rao:
On the multiway cut polyhedron. Networks 21(1): 51-89 (1991) - 1990
- [c1]Sunil Chopra, Giovanni Rinaldi:
The Graphical Asymmetric Traveling Salesman Polyhedron. IPCO 1990: 129-145
1980 – 1989
- 1989
- [j3]Sunil Chopra, David L. Jensen, Ellis L. Johnson:
Polyhedra of regularp-nary group problems. Math. Program. 43(1-3): 1-29 (1989) - [j2]Sunil Chopra:
On ternary problems. Math. Program. 45(1-3): 35-47 (1989) - 1987
- [j1]Sunil Chopra, Ellis L. Johnson:
Dual row modules and polyhedra of blocking group problems. Math. Program. 38(3): 229-270 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
