A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computer-aided transit scheduling. Proceedings of the fourth international workshop on computer-aided scheduling of public transport, held in Hamburg, FRG, 28th -- 31st July 1987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4275024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for crew pairing problems by column generation with an application to air transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural Lagrangean relaxation for two-duty period bus driver scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practicable steepest-edge simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest-edge simplex algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of highly degenerate linear programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Technique for Resolving Degeneracy in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent weights for lexicographic multi-objective programs: Characterizations and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming on Cray Supercomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank

Latest revision as of 08:03, 24 May 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references