Author:
Aliev Iskander,De Loera Jesús A.,Louveaux Quentin
Publisher
Springer International Publishing
Reference69 articles.
1. K. Aardal, A.K. Lenstra, Hard equality constrained integer knapsacks, in Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science (Springer, Berlin, 2002), pp. 350–366
2. D. Adjiashvili, T. Oertel, R. Weismantel, A polyhedral Frobenius theorem with applications to integer optimization. SIAM J. Discret. Math (to appear)
3. I. Aliev, M. Henk, Feasibility of integer knapsacks. SIAM J. Optim. 20, 2978–2993 (2010)
4. I. Aliev, M. Henk, A. Hinrichs, Expected Frobenius numbers. J. Comb. Theory A 118, 525–531 (2011)
5. I. Aliev, L. Fukshansky, M. Henk, Generalized Frobenius numbers: bounds and average behavior. Acta Arith. 155, 53–62 (2012)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On p-Frobenius of Affine Semigroups;Mediterranean Journal of Mathematics;2024-04-06
2. On the determination of p-Frobenius and related numbers using the p-Apéry set;Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas;2024-02-03
3. The Frobenius problem over number fields with a real embedding;Semigroup Forum;2024-01-29
4. The Generalized Frobenius Problem via Restricted Partition Functions;The Electronic Journal of Combinatorics;2023-08-25
5. p-Numerical semigroups with p-symmetric properties;Journal of Algebra and Its Applications;2023-06-26