Pages that link to "Item:Q1085073"
From MaRDI portal
The following pages link to Improving the Hungarian assignment algorithm (Q1085073):
Displayed 12 items.
- A decision support system for the single-depot vehicle rescheduling problem (Q856678) (← links)
- An addendum on the incremental assignment problem (Q1007874) (← links)
- Authors' response to ``An addendum on the incremental assignment problem'' by Volgenant (Q1007876) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- Travelling salesman problem tools for microcomputers (Q1184464) (← links)
- Personnel placement in a fuzzy environment (Q1185999) (← links)
- Speeding up the Hungarian algorithm (Q1823856) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
- Parallel Auction Algorithm for Bus Rescheduling (Q3525429) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)