A network simplex method
From MaRDI portal
Publication:4123079
DOI10.1007/BF01580379zbMATH Open0352.90039OpenAlexW2056178482MaRDI QIDQ4123079FDOQ4123079
Authors: William H. Cunningham 
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580379
Linear programming (90C05) Programming involving graphs or networks (90C35) Integer programming (90C10)
Cites Work
Cited In (47)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Modeling the satellite placement problem as a network flow problem with one side constraint
- A sequential dual simplex algorithm for the linear assignment problem
- On using priced timed automata to achieve optimal scheduling
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Minimum-cost flow algorithms: an experimental evaluation
- Critical objective function values in linear sum assignment problems
- Testing of a large-scale network optimization program
- Algorithms for network piecewise-linear programs: A comparative study
- A specialized network simplex algorithm for the constrained maximum flow problem
- A network penalty method
- A polynomial time primal network simplex algorithm for minimum cost flows
- An algorithm for the biobjective integer minimum cost flow problem
- A network simplex method for the budget-constrained minimum cost flow problem
- On a particular quadratic network problem
- Efficient dual simplex algorithms for the assignment problem
- On a multicriteria shortest path problem
- An extended abstract of an indepth algorithmic and computational study for maximum flow problems
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- A new pivot selection rule for the network simplex algorithm
- A comparison of solution strategies for biobjective shortest path problems
- A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
- Primal transportation and transshipment algorithms
- Combinatoric classes of the transportation problem and their properties
- 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
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- A competitive (dual) simplex method for the assignment problem
- The biobjective minimum cost flow problem
- A survey of dynamic network flows
- On cycling in the network simplex method
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
- Representing inverses in pure network flow optimization
- A genuinely polynomial primal simplex algorithm for the assignment problem
- Computational experience with exterior point algorithms for the transportation problem
- The alternating basis algorithm for assignment problems
- An infeasible (exterior point) simplex algorithm for assignment problems
- On the structure of the set bases of a degenerate point
- An exterior simplex type algorithm for the minimum cost network flow problem
- Recent trends in combinatorial optimization
- Solving the drift control problem
- The generalized alternating path algorithm for transportation problems
- Algorithms and codes for dense assignment problems: The state of the art
- A new strongly polynomial dual network simplex algorithm
- Title not available (Why is that?)
- Degeneracy in transportation problems
This page was built for publication: A network simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4123079)
