Publisher
Springer Berlin Heidelberg
Reference91 articles.
1. K. Aardal, R.E. Bixby, C.A.J. Hurkens A.K. Lenstra, and J.W. Smeltink, Market split and basisreduction: Towards a solution of the Cornuéjols-Dawande instances, INFORMS Journal on Computing 12 (2000) 192–202.
2. K. Aardal, C.A.J. Hurkens, and A.K. Lenstra, Solving a system of diophantine equations withlower and upper bounds on the variables, Mathematics of Operations Research 25 (2000) 427–442.
3. K. Aardal and A.K. Lenstra, Hard equality constrained integer knapsacks, Mathematics of Operations Research 29 (2004) 724–738.
4. K. Abhishek, S. Leyffer, and J.T. Linderoth, FilMINT: An outer-approximation-based solverfor nonlinear mixed integer programs, Preprint ANL/MCS-P1374-0906, Mathematics and Computer Science Division, Argonne National Lab, 2006.
5. T. Achterberg, Conflict analysis in mixed integer programming, Discrete Optimization 4 (2007) 4–20.
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献