Stochastic graph partitioning: quadratic versus SOCP formulations
DOI10.1007/S11590-015-0953-9zbMATH Open1355.90101OpenAlexW1871566589MaRDI QIDQ331990FDOQ331990
Renaud Sirdey, Dang Phuong Nguyen, Thanh Hai Nguyen, Viet Hung Nguyen, Michel Minoux
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
Recommendations
- On the two-stage stochastic graph partitioning problem
- Compact linearization for binary quadratic problems
- Improved linearized models for graph partitioning problem under capacity constraints
- Linear and quadratic programming approaches for the general graph partitioning problem
- Semidefinite programming relaxations for the graph partitioning problem
graph partitioningsecond-order cone programmingbranch-and-boundchance constrained programmingquadratic 0/1 programming
Quadratic programming (90C20) Programming involving graphs or networks (90C35) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Chance-constrained programming
- Applications of second-order cone programming
- On the cut polytope
- The node capacitated graph partitioning problem: A computational study
- The partition problem
- Facet-defining inequalities for the simple graph partitioning polytope
- On the Solution of a Graph Partitioning Problem under Capacity Constraints
- L’algebre de Boole et ses applications en recherche operationnelle
- Size-constrained graph partitioning polytopes
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- 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
- An improved linearization strategy for zero-one quadratic programming problems
- New approaches for optimizing over the semimetric polytope
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
- On the Two-Stage Stochastic Graph Partitioning Problem
- Central Limit Theorems for Sums of Dependent Vector Variables
Cited In (1)
Uses Software
This page was built for publication: Stochastic graph partitioning: quadratic versus SOCP formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331990)
