Search the dblp DataBase
Sunil Chopra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Sunil Chopra
The K-Edge Connected Spanning Subgraph Polyhedron. [Citation Graph (0, 0)][DBLP]
IPCO, 1992, pp:15-29 [Conf] - Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry
Algorithms and Extended Formulations for One and Two Facility Network Design. [Citation Graph (0, 0)][DBLP]
IPCO, 1996, pp:44-57 [Conf] - Sunil Chopra, Giovanni Rinaldi
The Graphical Asymmetric Traveling Salesman Polyhedron. [Citation Graph (0, 0)][DBLP]
IPCO, 1990, pp:129-145 [Conf] - Sunil Chopra
Compositions for Matroids with the Fulkerson Property. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:87-101 [Journal] - Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry
Source Sink Flows with Capacity Installation in Batches. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1998, v:85, n:3, pp:165-192 [Journal] - Sunil Chopra, Jonathan H. Owen
A Note on Formulations for the A-partition Problem on Hypergraphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1999, v:90, n:1-3, pp:115-133 [Journal] - Sunil Chopra, M. R. Rao
Facets of the K-partition Polytope. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1995, v:61, n:1, pp:27-48 [Journal] - Sunil Chopra, Chih-yang Tsai
A branch-and-cut approach for minimum cost multi-level network design. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:242, n:1-3, pp:65-92 [Journal] - Daniel Granot, Jeroen Kuipers, Sunil Chopra
Cost Allocation for a Tree Network with Heterogeneous Customers. [Citation Graph (0, 0)][DBLP]
Math. Oper. Res., 2002, v:27, n:4, pp:647-661 [Journal] - Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-yang Tsai
Minimum cost capacity installation for multicommodity network flows. [Citation Graph (0, 0)][DBLP]
Math. Program., 1998, v:81, n:, pp:177-199 [Journal] - Sunil Chopra, Jonathan H. Owen
Extended formulations for the A-cut problem. [Citation Graph (0, 0)][DBLP]
Math. Program., 1996, v:73, n:, pp:7-30 [Journal] - Sunil Chopra, M. R. Rao
The partition problem. [Citation Graph (0, 0)][DBLP]
Math. Program., 1993, v:59, n:, pp:87-115 [Journal] - Sunil Chopra, M. R. Rao
The Steiner tree problem I: Formulations, compositions and extension of facets. [Citation Graph (0, 0)][DBLP]
Math. Program., 1994, v:64, n:, pp:209-229 [Journal] - Sunil Chopra, M. R. Rao
The Steiner tree problem II: Properties and classes of facets. [Citation Graph (0, 0)][DBLP]
Math. Program., 1994, v:64, n:, pp:231-246 [Journal] - Sunil Chopra
Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1992, v:5, n:3, pp:321-337 [Journal] - Sunil Chopra
The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1992, v:5, n:4, pp:475-490 [Journal] - Sunil Chopra
The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1994, v:7, n:1, pp:16-31 [Journal] - Sunil Chopra
The k-Edge-Connected Spanning Subgraph Polyhedron. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1994, v:7, n:2, pp:245-259 [Journal] - Sunil Chopra, Giovanni Rinaldi
The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1996, v:9, n:4, pp:602-624 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002