Author:
Dokka Trivikram,Mourtos Ioannis,Spieksma Frits C. R.
Publisher
Springer Science and Business Media LLC
Subject
Software,Theoretical Computer Science
Reference24 articles.
1. Alvarez-Valdes, R., Parreo, F., Tamarit, J.: A branch-and-cut algorithm for the pallet loading problem. Comput. Oper. Res. 32, 3007–3029 (2005)
2. Appa, G., Magos, D., Mourtos, I.: On multi-index assignment polytopes. Linear Algebra Appl. 416, 224–241 (2006)
3. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006). (ISBN 978-0-691-12993-8)
4. Balas, E., Qi, L.: Linear-time separation algorithms for the three-index assignment polytope. Discrete Appl. Math. 43, 1–12 (1993)
5. Balas, E., Saltzman, M.: Facets of the three-index assignment polytope. Discrete Appl. Math. 23, 201–229 (1989)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献