Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BerkMin / rank | |||
Normal rank | |||
Revision as of 02:12, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cutting plane versus compact formulations for uncertain (integer) linear programs |
scientific article |
Statements
Cutting plane versus compact formulations for uncertain (integer) linear programs (English)
0 references
5 August 2013
0 references
optimization under uncertainty
0 references
cutting planes
0 references
uncertain set covering
0 references
uncertain connectivity problems
0 references
