Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127017626, #quickstatements; #temporary_batch_1722346090129 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2019.10.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2019.10.014 / rank | |||
Normal rank | |||
Latest revision as of 10:14, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling |
scientific article |
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
