The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
From MaRDI portal
(Redirected from Publication:1803742)
Recommendations
- The node capacitated graph partitioning problem: A computational study
- scientific article; zbMATH DE number 3991298
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
- On the solution of a graph partitioning problem under capacity constraints
Cites work
- scientific article; zbMATH DE number 3991298 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- A projection technique for partitioning the nodes of a graph
- Combinatorial Solution to the Partitioning of General Graphs
- Facets of the knapsack polytope
- The Optimal Partitioning of Graphs
Cited in
(11)- Reformulated acyclic partitioning for rail-rail containers transshipment
- Solving graph partitioning problems arising in tagless cache management
- Orbital branching
- scientific article; zbMATH DE number 3991298 (Why is no real title available?)
- A branch-and-bound algorithm for the acyclic partitioning problem
- An exact approach for the multi-constraint graph partitioning problem
- The node capacitated graph partitioning problem: A computational study
- On the solution of a graph partitioning problem under capacity constraints
- Compact mathematical formulation for graph partitioning
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
- A complementary column generation approach for the graph equipartition problem
This page was built for publication: The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803742)
