1. Inapproximabilty of densest k-subgraph from average case hardness;Alon,2011
2. Finding a large hidden clique in a random graph;Alon;Random Structures & Algorithms,1998
3. Dynamic Programming;Bellman,1957
4. An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem;Billionet;European Journal of Operational Research,2004
5. Using a mixed integer programming tool for solving the 0–1 quadratic knapsack problem;Billionet;INFORMS Journal on Computing,2004