Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A parametric algorithm for convex cost network flow and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full Analytical Implementation of the PARTAN/Frank–Wolfe Algorithm for Equilibrium Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Origin-Based Algorithm for the Traffic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-linear network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SDD linear systems in nearly <i>m</i> log <sup>1/2</sup> <i>n</i> time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Algorithm Is NP-Mighty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear networks. IIa / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Modifying Matrix Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural and algorithmic properties for parametric minimum cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry and Laplacian of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic results for potential‐based flows: Easy and hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the Inverse of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing network tolls with support constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4360236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopy methods to compute equilibria in game theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric shortest path algorithms with an application to cyclic staffing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving Nonlinear Resistor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing all Wardrop Equilibria parametrized by the Flow Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Lemke’s Method to the Piecewise Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial solvability of convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for minimum quadratic cost flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving integer minimum cost flows with separable convex cost objective polynomially / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of parametric linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Shortest Paths Via Quasi-convex Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3376534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bad network problem for the simplex method and other minimum cost flow algorithms / rank
 
Normal rank

Revision as of 00:04, 29 July 2024

scientific article; zbMATH DE number 7528010
Language Label Description Also known as
English
Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs
scientific article; zbMATH DE number 7528010

    Statements

    Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (English)
    0 references
    0 references
    0 references
    17 May 2022
    0 references
    parametric quadratic program
    0 references
    parametric flow
    0 references
    computational complexity
    0 references
    graph Laplacian
    0 references
    Wardrop equilibrium
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references