A polynomial projection algorithm for linear feasibility problems (Q747780): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for linear systems having a binary solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Solving Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the non-polynomiality of the relaxation method for systems of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the Inverse of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / 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: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many facets of linear programming / rank
 
Normal rank

Revision as of 21:49, 10 July 2024

scientific article
Language Label Description Also known as
English
A polynomial projection algorithm for linear feasibility problems
scientific article

    Statements

    Identifiers