Pages that link to "Item:Q1184442"
From MaRDI portal
The following pages link to An improved bounding procedure for the constrained assignment problem (Q1184442):
Displaying 6 items.
- A facet generation and relaxation technique applied to an assignment problem with side constraints (Q810374) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- A Lagrangean relaxation method for the constrained assignment problem (Q1086162) (← links)
- A bound-improving approach to discrete programming problems (Q1340059) (← links)
- A truncated exponential algorithm for the lightly constrained assignment problem (Q1369367) (← links)
- A branch-and-bound algorithm for the singly constrained assignment problem (Q2432890) (← links)