A practical anti-degeneracy row selection technique in network linear programming (Q1312776): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Properties of the Network Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical anti-cycling procedure for linearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-stalling pivot rules for the network simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of the network simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot selection methods of the Devex LP code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic scheduling via Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot Strategies for Primal-Simplex Network Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Technique for Resolving Degeneracy in Linear Programming / rank
 
Normal rank

Latest revision as of 12:51, 22 May 2024

scientific article
Language Label Description Also known as
English
A practical anti-degeneracy row selection technique in network linear programming
scientific article

    Statements

    A practical anti-degeneracy row selection technique in network linear programming (English)
    0 references
    0 references
    0 references
    5 May 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    degeneracy
    0 references
    pivoting
    0 references
    minimal cost network flow
    0 references
    primal network simplex algorithm
    0 references
    cycling
    0 references
    0 references
    0 references