A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LINDO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331939508844049 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059639915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses / 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: A Lagrangean relaxation method for the constrained assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Recent Advances in Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and Simple Algorithm for the Maximum Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Scaling Network Simplex Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization procedures for bounded variable primal simplex network algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Algorithms for Pure Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Postoptimality Analyses of the Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear symbolic-based approach to matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete algorithm for linear fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved version of the out-of-kilter method and a comparative study of computer codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alternating basis algorithm for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transmission facility planning in telecommunications networks: A heuristic approach / 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: Auction algorithms for network flow problems: A tutorial introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003376 / 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: On the computational behavior of a polynomial-time network flow algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Generalized Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some parametric integer and network programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved primal simplex variant for pure processing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degeneracy and the More-For-Less Paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: The more-for-less paradox in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Edmonds-Fukuda pivoting rule for simplex algorithms / 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 cycling in the network simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path algorithms: Taxonomy and annotation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitive and parametric analysis of the maximum flow in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of Shortest Path Algorithms in Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / 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: 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: A network penalty method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zero pivot phenomenon in transportation and assignment problems and its computational implications / 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: Q4131953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of dynamic trees in a network simplex algorithm for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network optimization: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dual simplex algorithms for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time / 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: Efficient Shortest Path Simplex Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practicable steepest-edge simplex algorithm / 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 dual approach to primal degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Polynomial Simplex Method for the Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Hungarian assignment algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of the Hungarian method for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Constrained Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the hungarian method / 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: Parametric linear programming and anti-cycling pivoting rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for a class of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing of a large-scale network optimization program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786267 / 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: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex-like method with bisection for linear programming<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible (exterior point) simplex algorithm for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving network manpower problems with side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tolerance approach to sensitivity analysis in network linear programming / 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: Characterization of all optimal solutions and parametric maximal mows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric maximal flows in generalized networks – complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource allocation on condition of random resource demand of network activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of the Simplex Method: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc tolerances in shortest path and network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding and Updating Spanning Trees and Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost operator algorithms for the transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fourth bibliography of fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum network flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-parametric analysis of the maximum tolerance in a linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to sensitivity analysis in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of optimal matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / 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
Property / cites work
 
Property / cites work: Integrating network optimization capabilities into a high-level modeling language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the continuity of solutions of parametric linear programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:16, 23 May 2024

scientific article; zbMATH DE number 751080
Language Label Description Also known as
English
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
scientific article; zbMATH DE number 751080

    Statements

    A comprehensive simplex-like algorithm for network optimization and perturbation analysis (English)
    0 references
    0 references
    8 May 1995
    0 references
    sensitivity analysis
    0 references
    tolerance analysis
    0 references
    degeneracy
    0 references
    network optimization
    0 references
    assignment
    0 references
    critical path
    0 references
    max flow
    0 references
    shortest path
    0 references
    transportation
    0 references
    self-dual simplex
    0 references
    LP perturbation analysis
    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
    0 references

    Identifiers