A shortest augmenting path algorithm for dense and sparse linear assignment problems
From MaRDI portal
Publication:1085784
DOI10.1007/BF02278710zbMath0607.90056WikidataQ60468438 ScholiaQ60468438MaRDI QIDQ1085784
Publication date: 1987
Published in: Computing (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
68R10: Graph theory (including graph drawing) in computer science
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
Numerical resolution of an “unbalanced” mass transport problem, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, New Rollout Algorithms for Combinatorial Optimization Problems, ENHANCED HIERARCHICAL SHAPE MATCHING FOR SHAPE TRANSFORMATION, Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order, On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem, Hybrid symbiotic genetic optimisation for robust edge-based stereo correspondence, A genuinely polynomial primal simplex algorithm for the assignment problem, The auction algorithm for the transportation problem, Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, Dual coordinate step methods for linear network flow problems, Auction algorithms for network flow problems: A tutorial introduction, Constrained weighted matchings and edge coverings in graphs, Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking, The \(k\)-cardinality assignment problem, Massively parallel augmenting path algorithms for the assignment problem, Kronecker product graph matching., Motion tracking as a constrained optimization problem., A note on the assignment problem with seniority and job priority constraints., Linear assignment procedures, A ranked linear assignment approach to Bayesian classification, A comparison of two algorithms for the assignment problem, A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem, Speeding up the Hungarian algorithm, Solving the \(k\)-cardinality assignment problem by transformation, An efficient heuristic for the expansion problem of cellular wireless networks, The singly constrained assignment problem: An AP basis algorithm, An efficient cost scaling algorithm for the assignment problem, Algorithms and codes for dense assignment problems: The state of the art, Point of presence design in internet protocol networks with performance guarantees, A branch-and-bound algorithm for the singly constrained assignment problem, Some assignment problems arising from multiple target tracking, Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies, An algorithm for ranking assignments using reoptimization, Linear and semi-assignment problems: A core oriented approach, Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem, Solving differential-algebraic equations by Taylor series. I: Computing Taylor coefficients, A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM, Large neighborhood improvements for solving car sequencing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- An efficient algorithm for the bipartite matching problem
- An efficient labeling technique for solving sparse assignment problems
- Improving the Hungarian assignment algorithm
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Algorithm for the solution of the assignment problem for sparse matrices
- An algorithm for the assignment problem
- Efficient dual simplex algorithms for the assignment problem
- A New Polynomially Bounded Shortest Path Algorithm
- Signature Methods for the Assignment Problem
- New Polynomial Shortest Path Algorithms and Their Computational Attributes
- An in-core/out-of-core method for solving large scale assignment problems
- An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
- Solving the Assignment Problem by Relaxation
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- A new algorithm for the assignment problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The alternating basis algorithm for assignment problems
- Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
- On some techniques useful for solution of transportation network problems
