Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q127713831, #quickstatements; #temporary_batch_1722284575798 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-019-00795-w / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-019-00795-W / rank | |||
Normal rank | |||
Latest revision as of 18:16, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods |
scientific article |
Statements
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (English)
0 references
3 December 2019
0 references
pooling problem
0 references
semidefinite relaxation
0 references
second-order cone relaxation
0 references
linear programming relaxation
0 references
rescheduling method
0 references
computational efficiency
0 references
0 references
0 references
