A competitive (dual) simplex method for the assignment problem
From MaRDI portal
Recommendations
- Efficient dual simplex algorithms for the assignment problem
- A genuinely polynomial primal simplex algorithm for the assignment problem
- A sequential dual simplex algorithm for the linear assignment problem
- A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
- The Scaling Network Simplex Algorithm
Cites work
- A network simplex method
- Efficient dual simplex algorithms for the assignment problem
- Faces of dual transportation polyhedra
- scientific article; zbMATH DE number 3837776 (Why is no real title available?)
- On the simplex algorithm for networks and generalized networks
- Signature Methods for the Assignment Problem
- Technical Note—A Polynomial Simplex Method for the Assignment Problem
- The alternating basis algorithm for assignment problems
- The Hirsch Conjecture for Dual Transportation Polyhedra
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Theoretical Properties of the Network Simplex Method
Cited in
(32)- A strongly polynomial simplex method for the linear fractional assignment problem
- A sequential dual simplex algorithm for the linear assignment problem
- Personnel placement in a fuzzy environment
- Solving linear bottleneck assignment problems via strong spanning trees
- A combinatorial algorithm for the Euler equations of incompressible flows
- The auction algorithm: A distributed relaxation method for the assignment problem
- An O(n^ 2) active set method for solving a certain parametric quadratic program
- A simple dual algorithm for the generalised assignment problem
- A new strongly polynomial dual network simplex algorithm
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- On solving a variation of the assignment problem
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
- Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems
- A relaxation column signature method for assignment problems
- The singly constrained assignment problem: An AP basis algorithm
- Strongly polynomial simplex algorithm for bipartite vertex packing
- Algorithms and codes for dense assignment problems: The state of the art
- An extended assignment problem considering multiple inputs and outputs
- The computational efficiency of Ji-Lee-Li algorithm for the assignment problem
- Adaptivity with moving grids
- Efficient dual simplex algorithms for the assignment problem
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems
- Numerical resolution of an “unbalanced” mass transport problem
- On the initialization methods of an exterior point algorithm for the assignment problem
- A genuinely polynomial primal simplex algorithm for the assignment problem
- Signature classes of transportation polytopes
- Active set algorithms for isotonic regression; a unifying framework
- Bounded isotonic median regression
- An infeasible (exterior point) simplex algorithm for assignment problems
- Sparse dual transportation polyhedra: Extreme points and signatures
- The auction algorithm for the transportation problem
- Worst case examples of an exterior point algorithm for the assignment problem
This page was built for publication: A competitive (dual) simplex method for the assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730345)
