Polyhedral-based Methods for Mixed-Integer SOCP in Tree Breeding

zbMath1453.90105arXiv1805.03809MaRDI QIDQ5132747

Tim J. Mullin, Makoto Yamashita, Sena Safarina

Publication date: 12 November 2020

Full work available at URL: https://arxiv.org/abs/1805.03809

zbMATH Keywords

optimizationsecond-order cone programmingoptimal selectionmixed integer conic programmingtree breedingconic relaxationequal deployment problemgeometric cut

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (2)

Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems ⋮ Exact SDP relaxations of quadratically constrained quadratic programs with forest structures

This page was built for publication: Polyhedral-based Methods for Mixed-Integer SOCP in Tree Breeding