Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127713831, #quickstatements; #temporary_batch_1722284575798 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127713831 / rank | |||
Normal rank | |||
Revision as of 21:27, 29 July 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
