A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
From MaRDI portal
Recommendations
- Effective algorithm and heuristic for the generalized assignment problem.
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
Cited in
(9)- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Generalized cover facet inequalities for the generalized assignment problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- The equilibrium generalized assignment problem and genetic algorithm
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- A Survey of the Generalized Assignment Problem and Its Applications
- (Pareto)-optimization and greedy algorithm-based solutions for review and panel assignments
- Lexicographic column generation with a tree search pricing algorithm
This page was built for publication: A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784114)