A network simplex method

DOI10.1007/BF01580379zbMath0352.90039OpenAlexW2056178482MaRDI QIDQ4123079

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580379

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05)

Related Items

Efficient dual simplex algorithms for the assignment problem, Degeneracy in transportation problems, A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems, On using priced timed automata to achieve optimal scheduling, A competitive (dual) simplex method for the assignment problem, Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach, A sequential dual simplex algorithm for the linear assignment problem, A polynomial time primal network simplex algorithm for minimum cost flows, A new strongly polynomial dual network simplex algorithm, A new pivot selection rule for the network simplex algorithm, Minimum-cost flow algorithms: an experimental evaluation, An extended abstract of an indepth algorithmic and computational study for maximum flow problems, A survey of dynamic network flows, Algorithms and codes for dense assignment problems: The state of the art, A network penalty method, Use of dynamic trees in a network simplex algorithm for the maximum flow problem, Critical objective function values in linear sum assignment problems, A new?old algorithm for minimum-cut and maximum-flow in closure graphs, A network simplex method for the budget-constrained minimum cost flow problem, A genuinely polynomial primal simplex algorithm for the assignment problem, An exterior simplex type algorithm for the minimum cost network flow problem, A comparison of solution strategies for biobjective shortest path problems, An algorithm for the biobjective integer minimum cost flow problem, A specialized network simplex algorithm for the constrained maximum flow problem, Computational experience with exterior point algorithms for the transportation problem, The biobjective undirected two-commodity minimum cost flow problem, Primal transportation and transshipment algorithms, On a particular quadratic network problem, The alternating basis algorithm for assignment problems, The generalized alternating path algorithm for transportation problems, A two-phase algorithm for the biobjective integer minimum cost flow problem, Testing of a large-scale network optimization program, A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time, Modeling the satellite placement problem as a network flow problem with one side constraint, A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem, Algorithms for network piecewise-linear programs: A comparative study, The biobjective minimum cost flow problem, On cycling in the network simplex method, Recent trends in combinatorial optimization, On a multicriteria shortest path problem, Solving the drift control problem, On the structure of the set bases of a degenerate point, Unnamed Item, Combinatoric classes of the transportation problem and their properties, Representing inverses in pure network flow optimization, An infeasible (exterior point) simplex algorithm for assignment problems, A network simplex algorithm with O(\(n\)) consecutive degenerate pivots

Cites Work