Stochastic graph partitioning: quadratic versus SOCP formulations

DOI10.1007/s11590-015-0953-9zbMath1355.90101OpenAlexW1871566589MaRDI QIDQ331990

Renaud Sirdey, Thanh Hai Nguyen, Viet Hung Nguyen, Michel Minoux, Dang-Phuong-Lan Nguyen

Publication date: 27 October 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://hal.sorbonne-universite.fr/hal-01362221/file/Nguyen_2015_Stochastic_graph.pdf

zbMATH Keywords

branch-and-boundgraph partitioningsecond-order cone programmingchance constrained programmingquadratic 0/1 programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Boolean programming (90C09)

Uses Software

• METIS

Cites Work

• Unnamed Item
• The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
• Size-constrained graph partitioning polytopes
• Applications of second-order cone programming
• Facets for the cut cone. I
• Facets for the cut cone. II: Clique-web inequalities
• The node capacitated graph partitioning problem: A computational study
• SONET/SDH ring assignment with capacity constraints
• Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
• Facets of the \(k\)-partition polytope
• The partition problem
• An improved linearization strategy for zero-one quadratic programming problems
• Facet-defining inequalities for the simple graph partitioning polytope
• New approaches for optimizing over the semimetric polytope
• Chance-Constrained Programming
• On the Solution of a Graph Partitioning Problem under Capacity Constraints
• L’algebre de Boole et ses applications en recherche operationnelle
• On the cut polytope
• On the Two-Stage Stochastic Graph Partitioning Problem
• Central Limit Theorems for Sums of Dependent Vector Variables

This page was built for publication: Stochastic graph partitioning: quadratic versus SOCP formulations