A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact cuts in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum flows in (s,t) planar networks / 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: On the simplex algorithm for networks and generalized networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and admissible transformations in combinatorial 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: A dual approach to primal degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow problems with one side constraint: A comparison of three solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational behavior of a polynomial-time network flow algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Postoptimality Analyses of the Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998396 / 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: Q4326383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycling in 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: Q5514188 / 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: Q3321331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: New crash procedures for large systems of linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bump triangular dynamic factorization algorithm for the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of 0-1 multiterminal network flows / rank
 
Normal rank

Revision as of 16:29, 4 June 2024

scientific article
Language Label Description Also known as
English
A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
scientific article

    Statements

    A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (English)
    0 references
    24 September 2002
    0 references
    minimum flow
    0 references
    self-dual simplex
    0 references
    perturbation analyses
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers