Assignment problems lie at the heart of combinatorial optimisation, seeking the most efficient mapping of a set of agents to a set of tasks under cost or profit criteria. The classical linear ...

Combinatorial optimisation problems, typified by tasks such as scheduling, routing, assignment and various knapsack variants, pose formidable challenges due to their exponential solution spaces and NP ...