1. On convex relaxations for quadratically constrained quadratic programming;Anstreicher;Math. Program.,2012
2. The Traveling Salesman Problem;Applegate,2011
3. Ds*: tighter lifting-free convex relaxations for quadratic matching problems;Bernard,2018
4. A new algorithm for the assignment problem;Bertsekas;Math. Program.,1981
5. Auction algorithms;Bertsekas;Encycl. Optim.,2009