An improved initial basis for the simplex algorithm (Q2387247): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An infeasible (exterior point) simplex algorithm for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient search direction for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient primal dual simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for simplex tableau reduction: The push-to-pull solution strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two direct methods in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient simplex type algorithm for sparse and dense linear programs. / rank
 
Normal rank

Revision as of 15:56, 10 June 2024

scientific article
Language Label Description Also known as
English
An improved initial basis for the simplex algorithm
scientific article

    Statements

    Identifiers