Threshold arrangements and the knapsack problem (Q812753): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.aml.2005.03.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074117568 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An alternative to Ben-Or's lower bound for the knapsack problem complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4331740 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4236280 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Threshold graphs and related topics / rank | |||
Normal rank | |||
Latest revision as of 09:40, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Threshold arrangements and the knapsack problem |
scientific article |
Statements
Threshold arrangements and the knapsack problem (English)
0 references
24 January 2006
0 references
Knapsack problem
0 references
threshold graphs
0 references
real number model
0 references
