A simplex-like method with bisection for linear programming<sup>1</sup> (Q3979523): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331939108843714 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972857658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4061081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and Degeneracy in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of the Pseudoinverse of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bigradients and the Euclid-Sturm Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linear programming problems requiring a large number of iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical finite pivoting rules for the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 10:27, 15 May 2024

scientific article
Language Label Description Also known as
English
A simplex-like method with bisection for linear programming<sup>1</sup>
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references