A genuinely polynomial primal simplex algorithm for the assignment problem

From MaRDI portal





The author presents a primal simplex algorithm that solves the assignment problem in \(O(n^ 2)\) pivot operations. The algorithm works with an increasing sequence of subgraphs. A feasible basis corresponds to a strongly feasible tree. Degeneration is dealt with Dantzig's rule. The total number of consecutive degenerate pivots is bounded by \({1\over 2}(n+ 2)(n- 1)\). The total number of nondegenerate pivots is bounded by \(n-1\). An update of the basis and dual variables can be performed in \(O(n)\) operations. The paper contains a short characterization of other primal or dual simplex algorithms for the assignment problem.



Cites work









This page was built for publication: A genuinely polynomial primal simplex algorithm for the assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686416)