Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm (Q1302732): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:21, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm |
scientific article |
Statements
Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm (English)
0 references
4 April 2000
0 references
genetic hybrid algorithm
0 references
trim loss
0 references
paper-converting mill
0 references
genetic algorithm
0 references
nonconvex mixed integer nonlinear programming
0 references
bilinear constraints
0 references
