Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem |
scientific article; zbMATH DE number 5009773
| 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; zbMATH DE number 5009773 |
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
0 references
0 references
0 references
0 references
