A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 07:54, 29 February 2024
scientific article; zbMATH DE number 7640785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Price Algorithm for the Multiple Knapsack Problem |
scientific article; zbMATH DE number 7640785 |
Statements
A Branch-and-Price Algorithm for the Multiple Knapsack Problem (English)
0 references
11 January 2023
0 references
multiple knapsack problem
0 references
branch-and-price
0 references
Lagrangian relaxation
0 references
