Heuristic algorithms for the multiple knapsack problem (Q1148788): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A heuristic routine for solving large loading problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for 0-1 multiple-knapsack problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of the zero-one multiple knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A bound and bound algorithm for the zero-one multiple knapsack problem / rank | |||
Normal rank | |||
Latest revision as of 11:23, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic algorithms for the multiple knapsack problem |
scientific article |
Statements
Heuristic algorithms for the multiple knapsack problem (English)
0 references
1981
0 references
heuristic algorithms
0 references
multiple knapsack problem
0 references
suboptimal solutions
0 references
computational experience
0 references
implementation
0 references
random test problems
0 references
large size problems
0 references
