Approximation hierarchies for the cone of flow matrices

DOI10.1016/j.endm.2018.02.002zbMath1388.90118OpenAlexW2789326813MaRDI QIDQ1742241

Marco Blanco, Thibaut Sauvage, Guillaume Sagnol

Publication date: 11 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.02.002

zbMATH Keywords

copositive programmingflows in graphsapproximation hierarchies

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22)

Related Items (1)

New advances and applications in deterministic and stochastic network optimization

Cites Work

• Unnamed Item
• Unnamed Item
• On the computational complexity of membership problems for the completely positive cone and its dual
• On the copositive representation of binary and continuous nonconvex quadratic programs
• New approximations for the cone of copositive matrices and its dual
• The Computational Complexity of Duality

This page was built for publication: Approximation hierarchies for the cone of flow matrices