 | 2002 |
|---|
| 20 |       | Sunil Chopra,
Chih-Yang Tsai:
A branch-and-cut approach for minimum cost multi-level network design.
Discrete Mathematics 242(1-3): 65-92 (2002) |
| 19 | | Daniel Granot,
Jeroen Kuipers,
Sunil Chopra:
Cost Allocation for a Tree Network with Heterogeneous Customers.
Math. Oper. Res. 27(4): 647-661 (2002) |
| 1999 |
|---|
| 18 | | Sunil Chopra,
Jonathan H. Owen:
A Note on Formulations for the A-partition Problem on Hypergraphs.
Discrete Applied Mathematics 90(1-3): 115-133 (1999) |
| 1998 |
|---|
| 17 | | Sunil Chopra,
Itzhak Gilboa,
S. Trilochan Sastry:
Source Sink Flows with Capacity Installation in Batches.
Discrete Applied Mathematics 85(3): 165-192 (1998) |
| 16 |  | 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 |
|---|
| 15 | | Sunil Chopra,
Itzhak Gilboa,
S. Trilochan Sastry:
Algorithms and Extended Formulations for One and Two Facility Network Design.
IPCO 1996: 44-57 |
| 14 | | Sunil Chopra,
Jonathan H. Owen:
Extended formulations for the A-cut problem.
Math. Program. 73: 7-30 (1996) |
| 13 | | Sunil Chopra,
Giovanni Rinaldi:
The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities.
SIAM J. Discrete Math. 9(4): 602-624 (1996) |
| 1995 |
|---|
| 12 | | Sunil Chopra,
M. R. Rao:
Facets of the K-partition Polytope.
Discrete Applied Mathematics 61(1): 27-48 (1995) |
| 11 | | Sunil Chopra:
Compositions for Matroids with the Fulkerson Property.
Discrete Applied Mathematics 62(1-3): 87-101 (1995) |
| 1994 |
|---|
| 10 | | Sunil Chopra,
M. R. Rao:
The Steiner tree problem I: Formulations, compositions and extension of facets.
Math. Program. 64: 209-229 (1994) |
| 9 | | Sunil Chopra,
M. R. Rao:
The Steiner tree problem II: Properties and classes of facets.
Math. Program. 64: 231-246 (1994) |
| 8 | | Sunil Chopra:
The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs.
SIAM J. Discrete Math. 7(1): 16-31 (1994) |
| 7 | | Sunil Chopra:
The k-Edge-Connected Spanning Subgraph Polyhedron.
SIAM J. Discrete Math. 7(2): 245-259 (1994) |
| 1993 |
|---|
| 6 | | Sunil Chopra,
M. R. Rao:
The partition problem.
Math. Program. 59: 87-115 (1993) |
| 1992 |
|---|
| 5 | | Sunil Chopra:
The K-Edge Connected Spanning Subgraph Polyhedron.
IPCO 1992: 15-29 |
| 4 | | Sunil Chopra,
Edgar R. Gorres,
M. R. Rao:
Solving the Steiner Tree Problem on a Graph Using Branch and Cut.
INFORMS Journal on Computing 4(3): 320-335 (1992) |
| 3 | | Sunil Chopra:
Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems.
SIAM J. Discrete Math. 5(3): 321-337 (1992) |
| 2 | | Sunil Chopra:
The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs.
SIAM J. Discrete Math. 5(4): 475-490 (1992) |
| 1990 |
|---|
| 1 | | Sunil Chopra,
Giovanni Rinaldi:
The Graphical Asymmetric Traveling Salesman Polyhedron.
IPCO 1990: 129-145 |
