Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7212666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling |
scientific article; zbMATH DE number 7212666 |
Statements
Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (English)
0 references
17 June 2020
0 references
combinatorial optimization
0 references
order acceptance identical parallel machine scheduling
0 references
mixed-integer programming
0 references
Benders decomposition
0 references
temporary cuts
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8097068667411804
0 references
0.8046848177909851
0 references
0.7701247334480286
0 references
0.7437213659286499
0 references
