The 1-Neighbour Knapsack Problem-Reference-Cited by-同舟云学术

The 1-Neighbour Knapsack Problem

Published:2011 Issue: Volume: Page:71-84
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Borradaile Glencora,Heeringa Brent,Wilfong Gordon

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-25011-8_6

Reference14 articles.

1. Boland, N., Fricke, C., Froyland, G., Sotirov, R.: Clique-based facets for the precedence constrained knapsack problem. Technical report. Tilburg University Repository, Netherlands (2005), http://arno.uvt.nl/oai/wo.uvt.nl.cgi

2. Borradaile, G., Heeringa, B., Wilfong, G.: The knapsack problem with neighbour constraints. CoRR, abs/0910.0777 (2011)

3. Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)

4. Goundan, P.R., Schulz, A.S.: Revisiting the greedy approach to submodular set function maximization (2009) (preprint)

5. Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of STOC, pp. 585–594 (2003)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimum Energy Utilization Strategy for Fleet of Autonomous Robots in Urban Waste Management;Robotics;2023-11-23

2. The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs;Operations Research Proceedings 2021;2022

3. The Knapsack Problem and Its Variants: Formulations and Solution Methods;The Palgrave Handbook of Operations Research;2022

4. The knapsack problem with special neighbor constraints;Mathematical Methods of Operations Research;2021-12-28