Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
A polynomial algorithm for the multiple knapsack problem with divisible item sizes
Information Processing Letters
The mixing set with divisible capacities
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
Discrete Applied Mathematics
A well-solvable special case of the bounded knapsack problem
Operations Research Letters
Motion Planning with Pulley, Rope, and Baskets
Theory of Computing Systems
Hi-index | 0.04 |