A network simplex method
From MaRDI portal
Publication:4123079
DOI10.1007/BF01580379zbMath0352.90039MaRDI QIDQ4123079
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C10: Integer programming
90C05: Linear programming
Related Items
An algorithm for the biobjective integer minimum cost flow problem, On a particular quadratic network problem, A genuinely polynomial primal simplex algorithm for the assignment problem, Computational experience with exterior point algorithms for the transportation problem, The biobjective undirected two-commodity minimum cost flow problem, 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, Recent trends in combinatorial optimization, On a multicriteria shortest path problem, On the structure of the set bases of a degenerate point, An infeasible (exterior point) simplex algorithm for assignment problems, On using priced timed automata to achieve optimal scheduling, A survey of dynamic network flows, An exterior simplex type algorithm for the minimum cost network flow problem, A comparison of solution strategies for biobjective shortest path problems, A two-phase algorithm for the biobjective integer minimum cost flow problem, Representing inverses in pure network flow optimization, Degeneracy in transportation problems, A sequential dual simplex algorithm for the linear assignment problem, An extended abstract of an indepth algorithmic and computational study for maximum flow problems, A network penalty method, Use of dynamic trees in a network simplex algorithm for the maximum flow problem, The generalized alternating path algorithm for transportation problems, Algorithms for network piecewise-linear programs: A comparative study, Combinatoric classes of the transportation problem and their properties, 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, The biobjective minimum cost flow problem, A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem, A network simplex algorithm with O(\(n\)) consecutive degenerate pivots, Algorithms and codes for dense assignment problems: The state of the art, A new?old algorithm for minimum-cut and maximum-flow in closure graphs, On cycling in the network simplex method, Efficient dual simplex algorithms for the assignment problem, A competitive (dual) simplex method for the assignment problem, Primal transportation and transshipment algorithms, The alternating basis algorithm for assignment problems, Testing of a large-scale network optimization program
Cites Work
