A branch-and-cut algorithm for the equicut problem
From MaRDI portal
Publication:1373750
DOI10.1007/BF02614373zbMATH Open0889.90142WikidataQ58002925 ScholiaQ58002925MaRDI QIDQ1373750FDOQ1373750
Authors: Lorenzo Brunetta, Michele Conforti, G. Rinaldi 
Publication date: 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- Engineering branch-and-cut algorithms for the equicut problem
- scientific article; zbMATH DE number 1064585
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- A branch and cut algorithm for the Steiner problem in graphs
- A simple algorithm for the multiway cut problem
- A branch-and-price algorithm for solving the cutting strips problem
- Branch-and-cut algorithms for the covering salesman problem
- A Branch and Cut Algorithm for a Steiner Tree-Star Problem
Cites Work
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- A new approach to the maximum-flow problem
- On the cut polytope
- Title not available (Why is that?)
- Facet identification for the symmetric traveling salesman polytope
- Odd Minimum Cut-Sets and b-Matchings
- The equipartition polytope. I: Formulations, dimension and basic facets
- Some new classes of facets for the equicut polytope
- The equipartition polytope. II: Valid inequalities and facets
Cited In (21)
- Facet-defining inequalities for the simple graph partitioning polytope
- Engineering branch-and-cut algorithms for the equicut problem
- An overview of graph covering and partitioning
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- An exact combinatorial algorithm for minimum graph bisection
- An effective iterated tabu search for the maximum bisection problem
- From equipartition to uniform cut polytopes: extended polyhedral results
- Models and methods for solving the problem of network vulnerability
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- Speeding up a memetic algorithm for the max-bisection problem
- Performance of a genetic algorithm for the graph partitioning problem
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint
- The node capacitated graph partitioning problem: A computational study
- Solution of large weighted equicut problems
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- An exact algorithm for graph partitioning
- \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
- Finding optimal solutions to the graph partitioning problem with heuristic search
- Partitioning through projections: strong SDP bounds for large graph partition problems
Uses Software
This page was built for publication: A branch-and-cut algorithm for the equicut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373750)
