Separation of Partition Inequalities

References

• Barahona F. Separating from the dominant of the spanning tree polytope. Oper. Res. Lett. (1992) 12 201 203 Crossref, Google Scholar
• Barahona F. Network design using cut inequalities. SIAM J. Optim. (1996a) 6 823 837 Crossref, Google Scholar
• Barahona F. On the k-cut problem. (1996b) . Report RC20677, IBM Google Scholar
• Barahona F. , Mahjoub A. R. On two-connected subgraph polytopes. Discrete Math. (1995) 147 19 34 Crossref, Google Scholar
• Cheng E. , Cunningham W. H. A faster algorithm for computing the strength of a network. Inform. Process. Lett. (1994) 49 209 212 Crossref, Google Scholar
• Chopra S. The k-edge connected spanning subgraph polyhedron. SIAM J. Discrete Math. (1994) 7 245 259 Crossref, Google Scholar
• Chopra S. , Stoer M. Private communication. (1996) Google Scholar
• Chvátal V. Tough graphs and hamiltonian circuits. Discrete Math. (1973) 5 215 228 Crossref, Google Scholar
• Cunningham W. H. Optimal attack and reinforcement of a network. J. ACM (1985) 32 549 561 Crossref, Google Scholar
• Didi Biha M. , Mahjoub A. R. k-edge connected polyhedra on series-parallel graphs. Oper. Res. Lett. (1996) 19 71 78 Crossref, Google Scholar
• Dinkelbach W. On nonlinear fractional programming. Management Sci. (1967) 13 492 498 Link, Google Scholar
• Edmonds J. , Guy R. K. , Milner E. , Sauer N. Submodular functions, matroids, and certain polyhedra. Combinatorial Structures and their Applications (1970) (Gordon and Breach, New York) 49 87 Google Scholar
• Fonlupt J. , Mahjoub A. R. Critical extreme points of the 2-edge connected spanning subgraph polytope. Proceedings IPCO'99, LNCS 1610 (1999) 166 183 Google Scholar
• Frank A. On the edge-connectivity algorithm of Nagamochi and Ibaraki. (1994) . Technical report, Laboratoire Artemis, IMAG, Université J. Fourier, Grenoble, France Google Scholar
• Goldschmidt O. , Hochbaum D. S. A polynomial algorithm for the k-cut problem for fixed k . Math. Oper. Res. (1994) 19 24 37 Link, Google Scholar
• Gröstchel M. , Lovász L. , Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988) (Springer) Google Scholar
• Gröstchel M. , Monma C. , Stoer M. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper. Res. (1992a) 40 309 330 Link, Google Scholar
• Gröstchel M. , Monma C. , Stoer M. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J. Optim. (1992b) 2 474 504 Crossref, Google Scholar
• Gröstchel M. , Monma C. , Stoer M. Polyhedral and computational investigations for designing communications networks with high survivability requirements. Oper. Res. (1995) 43 1012 1024 Link, Google Scholar
• Jünger M. , Pulleyblank W. R. New primal and dual matching heuristics. Algorithmica (1995) 13 357 380 Crossref, Google Scholar
• Karger D. R. , Stein C. A new approach to the minimum cut problem. J. ACM (1996) 43 601 640 Crossref, Google Scholar
• Lovász L. , Bachem A. , Gröstchel M. , Korte B. Submodular functions and convexity. Mathematical Programming: The state of the Art (1983) (Springer, Berlin) 235 257 Crossref, Google Scholar
• Mahjoub A. R. Two-edge connected spanning subgraphs and polyhedra. Math. Programming (1994) 64 199 208 Crossref, Google Scholar
• Nagamochi H. , Ibaraki T. Computing edge connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Math. (1992) 5 54 66 Crossref, Google Scholar
• Nash-Williams C. S. J. A. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. (1961) 36 445 450 Crossref, Google Scholar
• Padberg M. W. , Rao M. R. Odd minimum cutsets and b-matching. Math. Oper. Res. (1982) 7 67 80 Link, Google Scholar
• Queyranne M. A combinatorial algorithm for minimizing symmetric submodular functions. Proc. 6th ACM-SIAM Symp. Discrete Algorithms (1995) 98 101 Google Scholar
• Reinelt G. TSPLIB—A traveling salesman problem library. ORSA J. Computing (1991) 3 4 376 384 Link, Google Scholar
• Stoer M. , Wagner F. A simple min cut algorithm. Proceedings of the 1994 European Symposium on Algorithms (1994) (Springer-Verlag) 141 147 . LNCS 855 Crossref, Google Scholar
• Tutte W. T. On the problem of decomposing a graph into n connected factors. J. London Math. Soc. (1961) 36 221 230 Crossref, Google Scholar