A new algorithm for the quasi-assignment problem
From MaRDI portal
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Recommendations
- A new exact algorithm for the solution of quadratic assignment problems
- A new greedy algorithm for the quadratic assignment problem
- A new heuristic for the quadratic assignment problem
- An algorithm for quadratic assignment problems
- An Algorithm for the Quadratic Assignment Problem
- An algorithm for the generalized quadratic assignment problem
- A new lower bound for the quadratic assignment problem
- A New Lower Bound for the Quadratic Assignment Problem
Cites work
Cited in
(7)- FaSa: A fast and stable quadratic placement algorithm
- A decision support system for the single-depot vehicle rescheduling problem
- A new algorithm for stable assignment
- An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems
- A new algorithm for stable assignments
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- Parallel Auction Algorithm for Bus Rescheduling
This page was built for publication: A new algorithm for the quasi-assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808992)