2 citations · 2 across the 2 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2009★ 2 cited
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search
Sylvain Boussier, Michel Vasquez, Yannick Vimont +2
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove…
cs.DM2007
A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications
Sylvain Boussier, Hideki Hashimoto, Michel Vasquez
The subject of the 5th challenge proposed by the French Society of Operations Research and Decision Analysis (ROADEF) consists in scheduling technicians and interventions for telec…