New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
The generalized assignment problem with flexible jobs
Discrete Applied Mathematics
A column generation heuristic for a dynamic generalized assignment problem
Computers and Operations Research
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
Hi-index | 0.00 |