Pages that link to "Item:Q1369367"
From MaRDI portal
The following pages link to A truncated exponential algorithm for the lightly constrained assignment problem (Q1369367):
Displaying 7 items.
- A facet generation and relaxation technique applied to an assignment problem with side constraints (Q810374) (← links)
- A Lagrangean relaxation method for the constrained assignment problem (Q1086162) (← links)
- An improved bounding procedure for the constrained assignment problem (Q1184442) (← links)
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← 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)
- Resource-Constrained Assignment Scheduling (Q3750521) (← links)