Pages that link to "Item:Q1086162"
From MaRDI portal
The following pages link to A Lagrangean relaxation method for the constrained assignment problem (Q1086162):
Displayed 15 items.
- Network flow problems with one side constraint: A comparison of three solution methods (Q1102172) (← links)
- Applications of the parametric programming procedure (Q1179007) (← links)
- An improved bounding procedure for the constrained assignment problem (Q1184442) (← links)
- Resource constrained assignment problems (Q1264090) (← links)
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← links)
- Algorithms for finding a \(K\)th best valued assignment (Q1327213) (← links)
- The \(k\)-cardinality assignment problem (Q1363745) (← links)
- Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint (Q1814154) (← links)
- A constrained matching problem (Q1897380) (← links)
- The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints (Q2368115) (← links)
- A branch-and-bound algorithm for the singly constrained assignment problem (Q2432890) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)