Improving the Hungarian assignment algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A new algorithm for the assignment problem
- 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
- Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Signature Methods for the Assignment Problem
Cited in
(35)- Tolerance-based branch and bound algorithms for the ATSP
- scientific article; zbMATH DE number 1179832 (Why is no real title available?)
- scientific article; zbMATH DE number 4127004 (Why is no real title available?)
- A note of reduced dimension optimization algorithm of assignment problem
- Index matrices as a cost optimization tool of resource provisioning in uncertain cloud computing environment
- Remarks on implementation of O ( n 1/2 τ) assignment algorithms
- An addendum on the incremental assignment problem
- Authors' response to ``An addendum on the incremental assignment problem by Volgenant
- Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure
- Parallel Auction Algorithm for Bus Rescheduling
- scientific article; zbMATH DE number 4091179 (Why is no real title available?)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Personnel placement in a fuzzy environment
- Iterative patching and the asymmetric traveling salesman problem
- An algorithm for ranking assignments using reoptimization
- Travelling salesman problem tools for microcomputers
- Sensitivity analysis for bottleneck assignment problems
- Analysis and automatization of the Edmonds algorithm for the assignment problem
- Kalman filtering with censored measurements
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
- Un algoritmo misto per il problema dell'assegnazione pluridimensionale
- Study on the Hungarian algorithm for the maximum likelihood data association problem
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Speeding up the Hungarian algorithm
- A decision support system for the single-depot vehicle rescheduling problem
- Lower tolerance-based branch and bound algorithms for the ATSP
- Node matching computation between two large graphs in linear computational cost
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- The computational efficiency of Ji-Lee-Li algorithm for the assignment problem
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Algorithms and codes for dense assignment problems: The state of the art
- Contributions to the hungarian method
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
- ThIEF: finding genome-wide trajectories of epigenetics marks
This page was built for publication: Improving the Hungarian assignment algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085073)
