Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (Q1388884): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993418 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem / rank | |||
Normal rank |
Latest revision as of 12:56, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth |
scientific article |
Statements
Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (English)
0 references
2 February 1999
0 references
knapsack problem
0 references
branch-and-bound
0 references
large size 0-1 knapsack problems
0 references
core
0 references