A genuinely polynomial primal simplex algorithm for the assignment problem
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.
- A competitive (dual) simplex method for the assignment problem
- A data structure for dynamic trees
- A dual feasible forest algorithm for the linear assignment problem
- A genuinely polynomial primal simplex algorithm for the assignment problem
- A network simplex method
- A new algorithm for the assignment problem
- A Recursive Method for Solving Assignment Problems
- A sequential dual simplex algorithm for the linear assignment problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Algorithms for the Assignment and Transportation Problems
- An algebraic approach to assignment problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- Cost operator algorithms for the transportation problem
- Efficient dual simplex algorithms for the assignment problem
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- scientific article; zbMATH DE number 3876916 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3637616 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 3338967 (Why is no real title available?)
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- On some techniques useful for solution of transportation network problems
- On the simplex algorithm for networks and generalized networks
- Optimality and Computation of (σ, S) Policies in the Multi-Item Infinite Horizon Inventory Problem
- Primal-dual algorithms for the assignment problem
- Signature Methods for the Assignment Problem
- Solving the Assignment Problem by Relaxation
- Technical Note—A Polynomial Simplex Method for the Assignment Problem
- The alternating basis algorithm for assignment problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Theoretical Properties of the Network Simplex Method
- Travelling Salesman and Assignment Problems: A Survey
- A strongly polynomial simplex method for the linear fractional assignment problem
- Primal-dual algorithms for the assignment problem
- A polynomial time primal network simplex algorithm for minimum cost flows
- A new pivot selection rule for the network simplex algorithm
- Critical objective function values in linear sum assignment problems
- Sensitivity analysis of the optimal assignment.
- Algorithms and codes for dense assignment problems: The state of the art
- A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies
- The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
- On use of assignment algorithms to reconstruct inverse matrices
- Efficient dual simplex algorithms for the assignment problem
- A competitive (dual) simplex method for the assignment problem
- Ein Simplex-Algorithmus für das partitionsbeschränkte Zuordnungsproblem. (A simplex algorithm for the partition-restricted assignment problem)
- Exterior point simplex-type algorithms for linear and network optimization problems
- A graph space optimal transport distance as a generalization of L p distances: application to a seis
- A genuinely polynomial primal simplex algorithm for the assignment problem
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)