Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods (Q4015480): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q60140251, #quickstatements; #temporary_batch_1711094041063 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168047345 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60140251 / rank | |||
Normal rank | |||
Latest revision as of 13:59, 22 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods |
scientific article |
Statements
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods (English)
0 references
5 January 1993
0 references
relaxation of a set partitioning
0 references
airline crew scheduling
0 references
simplex method
0 references
interior point method
0 references
very large-scale linear programs
0 references
