From equipartition to uniform cut polytopes: extended polyhedral results
type: Item
instance of: scholarly article
title: From equipartition to uniform cut polytopes: extended polyhedral results
zbMATH Open document ID: 1222.05215
author: José Neto
published in: Discrete Mathematics
publication date: 2011-05-06T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5885485
zbMATH Keywords: uniform cut polytopes
zbMATH Keywords: graph partitioning
MaRDI profile type: Publication
full work available at URL: j.disc.2011.01.018
OpenAlex ID: W2069946405
cites work: On the Graph Bisection Cut Polytope
cites work: Facets of the Bipartite Subgraph Polytope
cites work: On the cut polytope
cites work: A branch-and-cut algorithm for the equicut problem
cites work: The equipartition polytope. I: Formulations, dimension and basic facets
cites work: The equipartition polytope. II: Valid inequalities and facets
cites work: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
cites work: Some new classes of facets for the equicut polytope
cites work: Geometry of cuts and metrics
cites work: Formulations and valid inequalities of the node capacitated graph partitioning problem
cites work: The node capacitated graph partitioning problem: A computational study
cites work: Q4198056
cites work: Via Minimization with Pin Preassignments and Layer Preference
DOI: 10.1016/J.DISC.2011.01.018
description: scientific article; zbMATH DE number 5885485