Yannick Vimont

According to our database1, Yannick Vimont authored at least 6 papers between 2005 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
On Solving the Queen Graph Coloring Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2010
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem.
Discret. Appl. Math., 2010

Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite.
Comput. Optim. Appl., 2010

2009
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search
CoRR, 2009

2008
Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem.
J. Comb. Optim., 2008

2005
Improved results on the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res., 2005


  Loading...