Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses-Reference-Cited by-同舟云学术

Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses

Published:1984-01 Issue:1 Volume:15 Page:100-109
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Frieze A.M.,Clarke M.R.B.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference13 articles.

1. The Desing and Analysis of Computer Algorithms;Aho,1974

2. Approximation algorithms for some generalised knapsack problems;Chandra;Theoret. Comput. Sci.,1976

3. Probabilistic Methods in Combinatorics;Erdös,1974

4. Khachian's algorithm for linear programming;Gács;Math. Programming Study,1981

5. Computers and Intractibility: a Guide to the Theory of NP-Completeness;Garey,1978

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

1. The preemptive resource allocation problem;Journal of Scheduling;2023-06-21

2. SEM-O-RAN: Semantic and Flexible O-RAN Slicing for NextG Edge-Assisted Mobile Systems;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications;2023-05-17

3. An Approximation Scheme for a Bilevel Knapsack Problem;Springer Proceedings in Mathematics & Statistics;2023

4. Work-in-Progress: Deadline-Constrained Multi-Resource Allocation in Edge-Cloud System;2022 IEEE Real-Time Systems Symposium (RTSS);2022-12

5. Multistage knapsack;Journal of Computer and System Sciences;2022-06