Integer Quadratic Programming
Integer Quadratic Programming is a mathematical optimization problem in which a quadratic objective function is minimized or maximized subject to linear constraints and the additional requirement that all decision variables must take integer values.
462
Publications
29.6K
Citations
1.2K
Authors
511
Institutions
Publications per year
2017–2026
138
Variants
Integer Quadratic Program
Parents
462
Support Vector Machines for Multiple-Instance Learning
Stuart Andrews, Ioannis Tsochantaridis, Thomas Hofmann · 2002 · 1.4K citations
Robust taboo search for the quadratic assignment problem
Éric D. Taillard · Parallel Computing · 1991 · 830 citations
1–5 of 462
1.2K
10
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 1.2K
511
Tsinghua University
Beijing, China
14 h-index
40 publications
3K citations

IMT School for Advanced Studies Lucca
Lucca, Italy
9 h-index
15 publications
556 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
18 publications
1.1K citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
17 publications
1.3K citations
Stanford University
Stanford, United States
8 h-index
20 publications
1.5K citations
Nanyang Technological University
Singapore, Singapore
7 h-index
22 publications
712 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
17 publications
753 citations
ETH Zurich
Zurich, Switzerland
6 h-index
16 publications
1.2K citations
1–8 of 511
21 publications · 2.3K citations
18
h-index
20 publications · 1.8K citations
17
h-index
13 publications · 989 citations
13
h-index
10 publications · 795 citations
10
h-index
9 publications · 509 citations
9
h-index
1–5