Facet-defining inequalities for the simple graph partitioning polytope
From MaRDI portal
Publication:2467133
DOI10.1016/J.DISOPT.2006.08.001zbMATH Open1163.90804OpenAlexW2079197386MaRDI QIDQ2467133FDOQ2467133
Publication date: 18 January 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.08.001
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometry of cuts and metrics
- On the cut polytope
- A cutting plane algorithm for a clustering problem
- The clique partitioning problem: Facets and patching facets
- Facets of the clique partitioning polytope
- The discrete p-dispersion problem
- The node capacitated graph partitioning problem: A computational study
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- The partition problem
- Clique-Web Facets for Multicut Polytopes
- Efficient Algorithm for the Partitioning of Trees
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- Lifting theorems and facet characterization for a class of clique partitioning inequalities
- Facets of the \(k\)-partition polytope
- 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
- A branch-and-cut algorithm for the equicut problem
- \(b\)-tree facets for the simple graph partitioning polytope
- A Note on Clique-Web Facets for Multicut Polytopes
- On Linear Characterizations of Combinatorial Optimization Problems
Cited In (9)
- An overview of graph covering and partitioning
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
- The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
- An extended edge-representative formulation for the \(K\)-partitioning problem
- Size-constrained graph partitioning polytopes
- Stochastic graph partitioning: quadratic versus SOCP formulations
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
- Political districting to minimize cut edges
This page was built for publication: Facet-defining inequalities for the simple graph partitioning polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467133)
