Formulations and valid inequalities of the node capacitated graph partitioning problem
From MaRDI portal
Recommendations
Cites work
- A cutting plane algorithm for a clustering problem
- Facets of the clique partitioning polytope
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- Min-cut clustering
- Non-Separable and Planar Graphs
- On the cut polytope
- 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
- The max-cut problem on graphs not contractible to \(K_ 5\)
- The node capacitated graph partitioning problem: A computational study
- The partition problem
Cited in
(41)- Cliques and clustering: A combinatorial approach
- The node capacitated graph partitioning problem: A computational study
- Cluster analysis and mathematical programming
- Reformulated acyclic partitioning for rail-rail containers transshipment
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts
- Political districting to minimize cut edges
- An overview of graph covering and partitioning
- An exact approach for the multi-constraint graph partitioning problem
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
- The partition problem
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Facet-defining inequalities for the simple graph partitioning polytope
- Compact linearization for binary quadratic problems
- Evaluating the quality of image matrices in blockmodeling
- An approximate dynamic programming approach to convex quadratic knapsack problems
- A polyhedral study of lifted multicuts
- A cycle-based formulation and valid inequalities for DC power transmission problems with switching
- Engineering branch-and-cut algorithms for the equicut problem
- On the solution of a graph partitioning problem under capacity constraints
- Solving graph partitioning problems arising in tagless cache management
- Iterated maxima search for the maximally diverse grouping problem
- Separation algorithm for tree partitioning inequalities
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
- A branch-and-bound algorithm for the acyclic partitioning problem
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- On the polyhedral structure of uniform cut polytopes
- Orbitopal fixing
- Cardinality constrained combinatorial optimization: complexity and polyhedra
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- From equipartition to uniform cut polytopes: extended polyhedral results
- Discrete relaxations of combinatorial programs
- Lagrangian heuristics for the quadratic knapsack problem
- Size-constrained graph partitioning polytopes
- The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Integer programming models and polyhedral study for the geodesic classification problem on graphs
- The quadratic knapsack problem
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- The quadratic knapsack problem -- a survey
This page was built for publication: Formulations and valid inequalities of the node capacitated graph partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814793)
