A (1–)-approximation algorithm for the generalized assignment problem-Reference-Cited by-同舟云学术

A (1–)-approximation algorithm for the generalized assignment problem

Published:2006-05 Issue:3 Volume:34 Page:283-288
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Nutov Zeev,Beniaminy Israel,Yuster Raphael

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference9 articles.

1. Approximation of a retrieval problem for parallel disks;Aerts;Lect. Notes in Comput. Sci.,2003

2. Random redundant storage in disk arrays: complexity of retrieval problems;Aerts;IEEE Trans. Comput.,2003

3. The Probabilistic Method;Alon,2000

4. C. Chekuri, S. Khanna, A PTAS for the multiple Knapsack problem, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2000, pp. 213-222.

5. M. Dawande, J. Kalagnanam, The multiple Knapsack problem with color constraints, IBM Research Report RC 21128 (94508) 1998.

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

1. Delay-Constrained Multicast Throughput Maximization in MEC Networks for High-Speed Railways;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2024

2. Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays;Operations Research;2022-07

3. A Hybrid Mathematical Programming-Heuristic Algorithm for a Sustainable Power Grid Maintenance Scheduling;Journal of the Korean Institute of Industrial Engineers;2022-02-15

4. Approximation algorithms for the generalized incremental knapsack problem;Mathematical Programming;2022-01-30

5. Throughput Maximization of Offloading Tasks in Multi-Access Edge Computing Networks for High-Speed Railways;IEEE Transactions on Vehicular Technology;2021-09