A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A dual strategy for solving the linear programming relaxation of a driver scheduling system |
scientific article; zbMATH DE number 830154
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual strategy for solving the linear programming relaxation of a driver scheduling system |
scientific article; zbMATH DE number 830154 |
Statements
A dual strategy for solving the linear programming relaxation of a driver scheduling system (English)
0 references
7 January 1996
0 references
multiple objectives
0 references
dual simplex
0 references
driver scheduling system
0 references
set covering and partitioning constraints
0 references
0 references
0 references
0 references
0.90714645
0 references
0.8723664
0 references
0.8677283
0 references
0.86476976
0 references
0.8564397
0 references
0.85613716
0 references
