Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods (Q4015480)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 86259
Language Label Description Also known as
default for all languages
No label defined
    English
    Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
    scientific article; zbMATH DE number 86259

      Statements

      Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      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

      Identifiers