Fast Approximation Algorithms for Knapsack Problems (Q3861164): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1287/moor.4.4.339 / rank | |||
Property / author | |||
Property / author: Eugene L. Lawler / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q94701723 / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Eugene L. Lawler / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1287/moor.4.4.339 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2113195911 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/mor/Lawler79 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1287/MOOR.4.4.339 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:54, 21 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast Approximation Algorithms for Knapsack Problems |
scientific article |
Statements
Fast Approximation Algorithms for Knapsack Problems (English)
0 references
1979
0 references
NP-complete problems
0 references
knapsack problem
0 references
subset sum problem
0 references
fully polynomial approximation schemes
0 references
approximate solution
0 references