Author:
Bonsma Paul,Schulz Jens,Wiese Andreas
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Heuristic Algorithm for the Temporal Knapsack Problem;2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS);2023-08-14
2. The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings;International Journal of Foundations of Computer Science;2023-03-22
3. A knapsack intersection hierarchy;Operations Research Letters;2023-01
4. A PTAS for unsplittable flow on a path;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. Approximation algorithms for the generalized incremental knapsack problem;Mathematical Programming;2022-01-30