Sunil Chopra

According to our database1, Sunil Chopra authored at least 41 papers between 1987 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Partial Demand Information and Commitment in Dynamic Transportation Procurement.
Transp. Sci., 2020

A strong formulation for the graph partition problem.
Networks, 2020

2019
The Covering Path Problem on a Grid.
Transp. Sci., 2019

Disruption Risk Management in Serial Multi-Echelon Supply Chains.
Found. Trends Technol. Inf. Oper. Manag., 2019

A concise characterization of strong knapsack facets.
Discret. Appl. Math., 2019

Generalizing the Covering Path Problem on a Grid.
CoRR, 2019

2018
A Bounded Formulation for The School Bus Scheduling Problem.
CoRR, 2018

2017
The worst case analysis of strong knapsack facets.
Math. Program., 2017

An extended formulation of the convex recoloring problem on a tree.
Math. Program., 2017

2016
Eco-activities and operating performance in the computer and electronics industry.
Eur. J. Oper. Res., 2016

Separation Algorithm for Tree Partitioning Inequalities.
Electron. Notes Discret. Math., 2016

2013
Binary group facets with complete support and non-binary coefficients.
Oper. Res. Lett., 2013

Facility Location Decisions with Random Disruptions and Imperfect Estimation.
Manuf. Serv. Oper. Manag., 2013

2004
Five Decades of Operations Management and the Prospects Ahead.
Manag. Sci., 2004

The Effect of Lead Time Uncertainty on Safety Stocks.
Decis. Sci., 2004

2002
Cost Allocation for a Tree Network with Heterogeneous Customers.
Math. Oper. Res., 2002

A branch-and-cut approach for minimum cost multi-level network design.
Discret. Math., 2002

1999
Networks And Flows.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Discrete Optimization.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

A Note on Formulations for the A-partition Problem on Hypergraphs.
Discret. Appl. Math., 1999

1998
Minimum cost capacity installation for multicommodity network flows.
Math. Program., 1998

Source Sink Flows with Capacity Installation in Batches.
Discret. Appl. Math., 1998

1996
The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities.
SIAM J. Discret. Math., 1996

Extended formulations for the A-cut problem.
Math. Program., 1996

Algorithms and Extended Formulations for One and Two Facility Network Design.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995
Facets of the K-partition Polytope.
Discret. Appl. Math., 1995

Compositions for Matroids with the Fulkerson Property.
Discret. Appl. Math., 1995

1994
The k-Edge-Connected Spanning Subgraph Polyhedron.
SIAM J. Discret. Math., 1994

The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs.
SIAM J. Discret. Math., 1994

The Steiner tree problem II: Properties and classes of facets.
Math. Program., 1994

The Steiner tree problem I: Formulations, compositions and extension of facets.
Math. Program., 1994

Comparison of formulations and a heuristic for packing Steiner trees in a graph.
Ann. Oper. Res., 1994

1993
The partition problem.
Math. Program., 1993

1992
The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs.
SIAM J. Discret. Math., 1992

Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems.
SIAM J. Discret. Math., 1992

Solving the Steiner Tree Problem on a Graph Using Branch and Cut.
INFORMS J. Comput., 1992

1991
On the multiway cut polyhedron.
Networks, 1991

1990
The Graphical Asymmetric Traveling Salesman Polyhedron.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989
Polyhedra of regular<i>p</i>-nary group problems.
Math. Program., 1989

On ternary problems.
Math. Program., 1989

1987
Dual row modules and polyhedra of blocking group problems.
Math. Program., 1987


  Loading...