A branch-and-cut algorithm for the equicut problem

Mathematical Programming, Series B

Volumn 78, Issue 2, 1997, Pages 243-263

  Brunetta, Lorenzo ^a   Conforti, Michele ^a   Rinaldi, Giovanni ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b CNR   (Italy)

Author keywords

Branch and cut; Cutting plane algorithm; Equicut; Heuristic algorithm; Max cut; Polyhedral theory

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; VECTORS;

BRANCH-AND-CUT ALGORITHMS; EQUICUT PROBLEMS; POLYHEDRAL THEORY;

ALGORITHMS;

EID: 0031208744     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614373     Document Type: Article

References (16)

1. F. Barahona and A.R. Mahjoub, On the cut polytope, Mathematical Programming 36 (1986) 157-173.
2. F. Barahona, M. Grötschel, M. Jünger and G. Reinelt, An application of combinatorial optimization to statistical physics and circuit layout design, Operations Research 36 (1988) 493-513.
3. M. Conforti, M.R. Rao and A. Sassano, The equipartition polytope I: Formulations, dimension and basic facets, Mathematical Programming 49 (1990) 49-70.
4. M. Conforti, M.R. Rao and A. Sassano, The equipartition polytope II: Valid inequalities and facets, Mathematical Programming 49 (1990) 71-90.
5. CPLEX, Using the CPLEX Callable Library and CPLEX Mixed Integer Library, CPLEX Optimization Inc. (1992).
6. C. De Simone and G. Rinaldi, A cutting-plane algorithm for the max-cut problem, Optimization Methods and Software 3 (1994) 195-214.
7. C.C. De Souza and M. Laurent, Some new classes of facets for the equicut polytope, Working Paper, CORE (Louvain-la-Neuve, 1991).
8. J. Edmonds and E.L. Johnson, Matching: A well solved class of integer linear programs, in: R. Guy, ed., Combinatorial Structures and Their Applications (Gordon and Breach, New York, 1970) 89-92.
9. A.V. Goldberg and R.E. Tarjan, A new approach to the maximum flow problem, Journal of ACM 35 (1988) 921-940.
10. D. Gusfield, Very simple algorithms and programs for all pairs network flow analysis, Research Report, University of California (Davis, California, 1987).
11. T.C. Hu, Multiterminal maximal flows, in: T.C. Hu, Integer Programming And Network Flows (Addison-Wesley, Reading, MA, 1969) 129-142.
12. B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Systems Technical Journal 49 (1970) 291-307.
13. M. Padberg and G. Rinaldi, Optimization of a 532-city symmetric traveling salesman problems, Operations Research Letters 6 (1987) 1-7.
14. M. Padberg and G. Rinaldi, Facet identification for the symmetric traveling salesman polytope, Mathematical Programming 47 (1990) 219-258.
15. M. Padberg and G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review 33 (1991) 1-41.
16. M. Padberg and M.R. Rao, Odd minimum cut-set and b-matchings, Mathematics of Operation Research 7 (1982) 67-80.