Pages that link to "Item:Q1318275"
From MaRDI portal
The following pages link to The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275):
Displaying 7 items.
- A Lagrangean relaxation method for the constrained assignment problem (Q1086162) (← links)
- A truncated exponential algorithm for the lightly constrained assignment problem (Q1369367) (← links)
- Heuristic and exact algorithms for the simultaneous assignment problem (Q1572972) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
- A branch-and-bound algorithm for the singly constrained assignment problem (Q2432890) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)