A Numerical Method for Solving Quadratic Integer Programming Problem
From MaRDI portal
Publication:5212531
DOI10.14529/mmp190311zbMath1437.90108OpenAlexW3000658656MaRDI QIDQ5212531
Vitaliĭ Mikhaĭlovich Tat'Yankin, Anatoliĭ Vyacheslavovich Shitselov
Publication date: 29 January 2020
Published in: Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software" (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vyuru510
Uses Software
Cites Work
- Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Nonlinear integer programming
- An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations
- Nonlinear Integer Programming
- Closest point search in lattices
This page was built for publication: A Numerical Method for Solving Quadratic Integer Programming Problem