A branch-and-cut algorithm for the equicut problem

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

scientific article; zbMATH DE number 3409134 (Why is no real title available?)
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
A new approach to the maximum-flow problem
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
An Efficient Heuristic Procedure for Partitioning Graphs
Facet identification for the symmetric traveling salesman polytope
Odd Minimum Cut-Sets and b-Matchings
On the cut polytope
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
Some new classes of facets for the equicut polytope
The equipartition polytope. I: Formulations, dimension and basic facets
The equipartition polytope. II: Valid inequalities and facets

Cited in

(21)

A branch-price-and-cut algorithm for packing cuts in undirected graphs
Facet-defining inequalities for the simple graph partitioning polytope
From equipartition to uniform cut polytopes: extended polyhedral results
An overview of graph covering and partitioning
The node capacitated graph partitioning problem: A computational study
\texttt{CP-Lib}: benchmark instances of the clique partitioning problem
Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
A branch-and-bound algorithm for solving max-\(k\)-cut problem
An exact algorithm for min-max hyperstructure equipartition with a connected constraint
Models and methods for solving the problem of network vulnerability
An exact combinatorial algorithm for minimum graph bisection
An effective iterated tabu search for the maximum bisection problem
An exact algorithm for graph partitioning
Solution of large weighted equicut problems
Finding optimal solutions to the graph partitioning problem with heuristic search
A branch-and-bound algorithm for the minimum cut linear arrangement problem
Speeding up a memetic algorithm for the max-bisection problem
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
Engineering branch-and-cut algorithms for the equicut problem
Performance of a genetic algorithm for the graph partitioning problem
Partitioning through projections: strong SDP bounds for large graph partition problems

Describes a project that uses

Uses Software

CPLEX

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)