Stochastic graph partitioning: quadratic versus SOCP formulations
type: Item
instance of: scholarly article
title: Stochastic graph partitioning: quadratic versus SOCP formulations
zbMATH Open document ID: 1355.90101
author: Michel Minoux
author: Viet Hung Nguyen
author: Thanh Hai Nguyen
author: Renaud Sirdey
author: Dang Phuong Nguyen
published in: Optimization Letters
publication date: 2016-10-27T00:00:00Z
full work available at URL: Nguyen 2015 Stochastic graph.pdf
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6644663
zbMATH Keywords: graph partitioning
zbMATH Keywords: chance constrained programming
zbMATH Keywords: second-order cone programming
zbMATH Keywords: quadratic 0/1 programming
zbMATH Keywords: branch-and-bound
describes a project that uses: METIS
MaRDI profile type: Publication
OpenAlex ID: W1871566589
cites work: On the cut polytope
cites work: Facet-defining inequalities for the simple graph partitioning polytope
cites work: On the Solution of a Graph Partitioning Problem under Capacity Constraints
cites work: Chance-constrained programming
cites work: The partition problem
cites work: Facets of the \(k\)-partition polytope
cites work: Central Limit Theorems for Sums of Dependent Vector Variables
cites work: Facets for the cut cone. I
cites work: Facets for the cut cone. II: Clique-web inequalities
cites work: On the Two-Stage Stochastic Graph Partitioning Problem
cites work: The node capacitated graph partitioning problem: A computational study
cites work: L’algebre de Boole et ses applications en recherche operationnelle
cites work: New approaches for optimizing over the semimetric polytope
cites work: Q4198056
cites work: SONET/SDH ring assignment with capacity constraints
cites work: Size-constrained graph partitioning polytopes
cites work: An improved linearization strategy for zero-one quadratic programming problems
cites work: Applications of second-order cone programming
cites work: Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
cites work: The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
DOI: 10.1007/S11590-015-0953-9
description: scientific article; zbMATH DE number 6644663