A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for the multiple knapsack problem with assignment restrictions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4941826 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integer Programming with a Fixed Number of Variables / rank | |||
Normal rank | |||
Latest revision as of 11:04, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A PTAS for the multiple subset sum problem with different knapsack capacities |
scientific article |
Statements
A PTAS for the multiple subset sum problem with different knapsack capacities (English)
0 references
25 July 2002
0 references
multiple subset sum problem
0 references
0 references
