Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Bar-Yehuda, R., Rawitz, D.: Efficient algorithms for integer programs with two variables per constraint. Algorithmica 29(4), 595–609 (2001)
2. Lagarias, J.C.: The computational complexity of simultaneous diophantine approximation problems. SIAM Journal on Computing 14, 196–209 (1985)
3. ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Information available at,
http://www.cplex.com
4. Savelsbergh, M.: Local Search for Routing Problems with Time Windows. Annals of Operations Research 4, 285–305 (1986)
5. SIAM Monographs on Discrete Mathematics and Applications;P. Toth,2002
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献