Conic relaxation approaches for equal deployment problems

DOI10.1016/j.dam.2019.04.032zbMath1433.90107arXiv1703.03155OpenAlexW2973618826MaRDI QIDQ2297663

Tim J. Mullin, Makoto Yamashita, Satoko Moriguchi, Sena Safarina

Publication date: 20 February 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite programmingsecond-order cone programmingmixed-integer conic programmingtree breedingconic relaxationequal deployment problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11) Continuous location (90B85) Quadratic programming (90C20)

Related Items

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

Uses Software

• SDPT3
• ECOS
• OPSEL

Cites Work

• Second order cone programming relaxation of nonconvex quadratic optimization problems
• Latest Developments in the SDPA Family for Solving Large-Scale SDPs
• Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
• Semidefinite optimization
• A Simple Method for Computing the Inverse of a Numerator Relationship Matrix Used in Prediction of Breeding Values
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Discrete Convex Analysis
• Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• On Steepest Descent Algorithms for Discrete Convex Functions
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• On Polyhedral Approximations of the Second-Order Cone

This page was built for publication: Conic relaxation approaches for equal deployment problems