A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/ijoc.2022.1223 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4292737938 / rank | |||
Normal rank | |||
Revision as of 19:05, 19 March 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
