A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:05, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual strategy for solving the linear programming relaxation of a driver scheduling system |
scientific article |
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
