Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs (Q5176341)
From MaRDI portal
scientific article; zbMATH DE number 6410624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs |
scientific article; zbMATH DE number 6410624 |
Statements
Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs (English)
0 references
3 March 2015
0 references
