Searching for "Approximate Algorithms for the 0/1 Knapsack Problem." – sorted by Relevance.
6 documents found, showing 1 through 6.
-
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
- …-hard; Approximation algorithms; Probabilistic analysis 1. Introduction The 0/1 knapsack problem has been studied…
- Cited by 1 (0 self) – Add To MetaCart
-
Exponentially Small Bounds on the Expected Optimum of the Partition and Subset Sum Problems
- … algorithms for the 0-1 Knapsack problem [Luek82, GMS84]. The median solution to the partition problem…
- Cited by 9 (0 self) – Add To MetaCart
-
Improved Fully Polynomial time Approximation Scheme for the 0-1 Multiple-choice Knapsack Problem
- …Improved Fully Polynomial time Approximation Scheme for the 0-1 Multiple-choice Knapsack Problem…
- Cited by 1 (0 self) – Add To MetaCart
-
A Tractable Heuristic that Maximizes Global Utility through Local Plan Combination
- … for handling the 0/1-knapsack problem (Horowitz & Sahni 1978). Figure 2 outlines one such algorithm (a socalled…
- Cited by 18 (2 self) – Add To MetaCart
-
A Revenue-Based Model for Making Resource Investment Decisions in IP Networks
- … � ����������� to: . This optimization problem is � a version of the 0-1 Knapsack problem which is known to be NP…
- Cited by 2 (0 self) – Add To MetaCart
-
The 0-1 Knapsack Problem -- An Introductory Survey
- … approximation algorithm for the 0--1 Knapsack problem (the heuristic given in the introduction): 1. Order…
- Cited by 6 (0 self) – Add To MetaCart
Showing 1 through 6.
