A branch-and-cut algorithm for the connected max-\(k\)-cut problem
From MaRDI portal
Publication:6069218
DOI10.1016/j.ejor.2023.06.015MaRDI QIDQ6069218
No author found.
Publication date: 14 November 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Packing and partitioning orbitopes
- Cliques, holes and the vertex coloring polytope
- Facets of two Steiner arborescence polyhedra
- Clustering data that are graph connected
- A branch-and-price procedure for clustering data that are graph connected
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Polytopes associated with symmetry handling
- A branch-and-cut algorithm for graph coloring
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- On the Solution of a Graph Partitioning Problem under Capacity Constraints
- Solving Steiner tree problems in graphs to optimality
- On the cut polytope
This page was built for publication: A branch-and-cut algorithm for the connected max-\(k\)-cut problem
