Technical Note—A Polynomial Simplex Method for the Assignment Problem
From MaRDI portal
Publication:3669175
DOI10.1287/opre.31.3.595zbMath0519.90056OpenAlexW2067045754MaRDI QIDQ3669175
Publication date: 1983
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.31.3.595
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (17)
Efficient dual simplex algorithms for the assignment problem ⋮ A competitive (dual) simplex method for the assignment problem ⋮ A polynomial time primal network simplex algorithm for minimum cost flows ⋮ A new algorithm for the assignment problem: An alternative to the Hungarian method ⋮ The auction algorithm for the transportation problem ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Polynomial-time primal simplex algorithms for the minimum cost network flow problem ⋮ A genuinely polynomial primal simplex algorithm for the assignment problem ⋮ A strongly polynomial simplex method for the linear fractional assignment problem ⋮ Active set algorithms for isotonic regression; a unifying framework ⋮ A time-triggered dimension reduction algorithm for the task assignment problem ⋮ Bounded isotonic median regression ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ 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
This page was built for publication: Technical Note—A Polynomial Simplex Method for the Assignment Problem
