An approximation algorithm for indefinite mixed integer quadratic programming

In this paper, we give an algorithm that finds an ϵ -approximate solution to a mixed integer quadratic programming (MIQP) problem. The algorithm runs in polynomial time if the rank of the quadratic function and the number of integer variables are fixed. The running time of the algorithm is expected...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 201; no. 1-2; pp. 263 - 293
Main Author:	Pia, Alberto Del
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2023 Springer
Subjects:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical 90C20 Mixed integer quadratic programming Symmetric decomposition 90C11 90C26 90C59 Approximation algorithm Simultaneous diagonalization Polynomial time
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!