Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OSL / rank | |||
Normal rank | |||
Revision as of 01:31, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem |
scientific article |
Statements
Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (English)
0 references
7 March 2006
0 references
open-source software
0 references
cutting stock problem
0 references
branch-and-price methods
0 references
integer programming
0 references
