Threshold assignment algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4130203
- scientific article; zbMATH DE number 176471
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
Cited in
(13)- Microcomputer-based algorithms for large scale shortest path problems
- Minimizing average project team size given multi-skilled workers with heterogeneous skill levels
- Shortest paths algorithms: Theory and experimental evaluation
- Parallel asynchronous algorithms for the K shortest paths problem
- Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- A user's guide to tabu search
- scientific article; zbMATH DE number 4130203 (Why is no real title available?)
- The shortest path problem on large-scale real-road networks
- scientific article; zbMATH DE number 21745 (Why is no real title available?)
- scientific article; zbMATH DE number 221925 (Why is no real title available?)
- Exterior point simplex-type algorithms for linear and network optimization problems
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
This page was built for publication: Threshold assignment algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3743115)