Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference27 articles.
1. W.P. Adams, T. Johnson, Improved linear programming-based lower bounds for the quadratic assignment problem, in: P. Pardalos, H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, 1994, pp. 43–76.
2. A tight linearization and an algorithm for zero-one quadratic programming problems;Adams;Management Science,1986
3. A lift-and-project cutting plane algorithm for mixed 0–1 programs;Balas;Mathematical Programming,1993
4. Linear programming for the 0–1 quadratic Knapsack problem;Billionnet;European Journal of Operational Research,1996
5. A heuristic method for the set covering problem;Caprara;Operations Research,1999
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献