A least-squares minimum-cost network flow algorithm (Q646641): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A least-squares primal-dual algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential function methods for approximately solving linear programming problems: theory and practice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323698 / 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: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Cost Reoptimization for Min-Cost Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exterior simplex type algorithm for the minimum cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283440 / 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: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strictly improving linear programming Phase I algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time primal network simplex algorithm for minimum cost flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fortran subroutines for network flow optimization using an interior point algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial combinatorial algorithm for generalized minimum cost flow / rank
 
Normal rank

Latest revision as of 16:29, 4 July 2024

scientific article
Language Label Description Also known as
English
A least-squares minimum-cost network flow algorithm
scientific article

    Statements

    A least-squares minimum-cost network flow algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2011
    0 references
    0 references
    network flow
    0 references
    least-squares
    0 references
    primal-dual
    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