Presolving in linear programming (Q1914076): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global approach to crew-pairing optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Simplex Method: The Initial Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commentary—Progress in Linear Programming / 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: Analysis of mathematical programming problems prior to applying the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchical algorithm for making sparse matrices sparser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the simplex method for the Optimization Subroutine Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal optimization of some reduced linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pathological case in the reduction of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding duplicate rows in a linear programming model / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01586000 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063558363 / rank
 
Normal rank

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Presolving in linear programming
scientific article

    Statements

    Presolving in linear programming (English)
    0 references
    0 references
    0 references
    2 June 1996
    0 references
    interior-point methods
    0 references
    presolve phase
    0 references
    survey of presolve methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers