Michel Vasquez
Orcid: 0000-0001-6346-2550
According to our database1,
Michel Vasquez
authored at least 32 papers
between 2001 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
0
1
2
3
4
5
6
1
1
1
1
1
1
1
2
3
1
1
1
2
2
3
1
2
1
1
3
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
J. Heuristics, 2023
2022
Is Transfer Learning Helpful for Neural Combinatorial Optimization Applied to Vehicle Routing Problems?
Comput. Informatics, 2022
Neural Order-First Split-Second Algorithm for the Capacitated Vehicle Routing Problem.
Proceedings of the Optimization and Learning - 5th International Conference, 2022
2020
Hierarchical Reasoning and Knapsack Problem Modelling to Design the Ideal Assortment in Retail.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2020
Apprentissage automatique pour l'optimisation combinatoire : étude du problème du voyageur de commerce.
Proceedings of the Conférence Nationale en Intelligence Artificielle, 2020
2018
2017
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017
2016
Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing.
Comput. Oper. Res., 2016
2015
A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems.
RAIRO Oper. Res., 2015
2013
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems.
J. Heuristics, 2013
2011
A GRASP-based approach for technicians and interventions scheduling for telecommunications.
Ann. Oper. Res., 2011
2010
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
Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications.
RAIRO Oper. Res., 2009
2008
Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem.
J. Comb. Optim., 2008
2007
A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications
CoRR, 2007
Improving Local Search for Satisfiability Problem by Integrating Structural Properties.
Proceedings of the 2007 IEEE International Conference on Research, 2007
2005
Eur. J. Oper. Res., 2005
2004
J. Heuristics, 2004
Efficient Filtering and Tabu Search on a Consistent Neighbourhood for the Frequency Assignment Problem with Polarisation.
Ann. Oper. Res., 2004
Algorithmes complet et incomplet pour la coloration des graphes de reines.
Proceedings of the Programmation en logique avec contraintes, 2004
Solving the Selecting and Scheduling Satellite Photographs Problem with a Consistent Neighborhood Heuristic.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004
Complete and Incomplete Algorithms for the Queen Graph Coloring Problem.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004
2003
Consistency checking within local search applied to the frequency assignment with polarization problem.
RAIRO Oper. Res., 2003
J. Comb. Optim., 2003
2002
Proceedings of the Principles and Practice of Constraint Programming, 2002
2001
RAIRO Oper. Res., 2001
J. Heuristics, 2001
A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite.
Comput. Optim. Appl., 2001
A Hybrid Approach for the 01 Multidimensional Knapsack problem.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001