Abstract
We present a primal simplex algorithm that solves the assignment problem in 1 2 n( n+3)−4 pivots. Starting with a problem of size 1, we sequentially solve problems of size 2,3,4,…, n. The algorithm utilizes degeneracy by working with strongly feasible trees and employs Dantzig's rule for entering edges for the subproblem. The number of nondegenerate simplex pivots is bounded by n−1. The number of consecutive degenerate simplex pivots is bounded by 1 2 ( n−2)( n+1). All three bounds are sharp. The algorithm can be implemented to run in O( n 3) time for dense graphs. For sparse graphs, using state of the art data structures, it runs in O( n 2 log n+ nm) time, where the bipartite graph has 2 n nodes and m edges.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
