Separation of partition inequalities

Mathematics of Operations Research

Volumn 25, Issue 2, 2000, Pages 243-254

  Baïou, Mourad ^a   Barahona, Francisco ^b   Mahjoub, Ali Ridha ^c  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSITÉ DE BRETAGNE OCCIDENTALE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS;

ASSOCIATED SEPARATION; PARTITION INEQUALITIES;

OPERATIONS RESEARCH;

EID: 0342918700     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.25.2.243.12223     Document Type: Article

References (30)

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