Michel Vasquez

According to our database, Michel Vasquez authored at least 32 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

An efficient scenario penalization matheuristic for a stochastic scheduling problem.

Michel Vasquez, Mirsad Buljubasic, Saïd Hanafi

J. Heuristics, 2023

2022

Is Transfer Learning Helpful for Neural Combinatorial Optimization Applied to Vehicle Routing Problems?

Ali Yaddaden, Sébastien Harispe, Michel Vasquez

Comput. Informatics, 2022

Neural Order-First Split-Second Algorithm for the Capacitated Vehicle Routing Problem.

Ali Yaddaden, Sébastien Harispe, Michel Vasquez

Proceedings of the Optimization and Learning - 5th International Conference, 2022

2020

Hierarchical Reasoning and Knapsack Problem Modelling to Design the Ideal Assortment in Retail.

Jocelyn Poncelet, Pierre-Antoine Jean, Michel Vasquez, Jacky Montmain

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.

Ali Yaddaden, Sébastien Harispe, Michel Vasquez, Mirsad Bukjubasic

Proceedings of the Conférence Nationale en Intelligence Artificielle, 2020

2018

Two-phase heuristic for SNCF rolling stock problem.

Mirsad Buljubasic, Michel Vasquez, Haris Gavranovic

Ann. Oper. Res., 2018

2017

On Solving the Queen Graph Coloring Problem.

Michel Vasquez, Yannick Vimont

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016

Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing.

Mirsad Buljubasic, Michel Vasquez

Comput. Oper. Res., 2016

2015

A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems.

Nicolas Zufferey, Michel Vasquez

RAIRO Oper. Res., 2015

2013

Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems.

Saïd Hanafi, Ahmed Riadh Rebai, Michel Vasquez

J. Heuristics, 2013

2011

A GRASP-based approach for technicians and interventions scheduling for telecommunications.

Hideki Hashimoto, Sylvain Boussier, Michel Vasquez, Christophe Wilbaut

Ann. Oper. Res., 2011

2010

A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem.

Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon

Discret. Appl. Math., 2010

Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite.

Djamal Habet, Michel Vasquez, Yannick Vimont

Comput. Optim. Appl., 2010

2009

Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications.

Sylvain Boussier, Hideki Hashimoto, Michel Vasquez, Christophe Wilbaut

RAIRO Oper. Res., 2009

The dynamic frequency assignment problem.

Audrey Dupont, Andréa Carneiro Linhares, Christian Artigues, Dominique Feillet, Philippe Michelon, Michel Vasquez

Eur. J. Oper. Res., 2009

Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search

Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon

CoRR, 2009

2008

Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem.

Yannick Vimont, Sylvain Boussier, Michel Vasquez

J. Comb. Optim., 2008

2007

A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications

Sylvain Boussier, Hideki Hashimoto, Michel Vasquez

CoRR, 2007

Improving Local Search for Satisfiability Problem by Integrating Structural Properties.

Djamal Habet, Michel Vasquez

Proceedings of the 2007 IEEE International Conference on Research, 2007

2005

Improved results on the 0-1 multidimensional knapsack problem.

Michel Vasquez, Yannick Vimont

Eur. J. Oper. Res., 2005

2004

New Results on the Queens_<i>n</i>² Graph Coloring Problem.

Michel Vasquez

J. Heuristics, 2004

Efficient Filtering and Tabu Search on a Consistent Neighbourhood for the Frequency Assignment Problem with Polarisation.

Audrey Dupont, Eric Alvernhe, Michel Vasquez

Ann. Oper. Res., 2004

Algorithmes complet et incomplet pour la coloration des graphes de reines.

Michel Vasquez, Djamal Habet

Proceedings of the Programmation en logique avec contraintes, 2004

Solving the Selecting and Scheduling Satellite Photographs Problem with a Consistent Neighborhood Heuristic.

Djamal Habet, Michel Vasquez

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.

Michel Vasquez, Djamal Habet

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2003

Consistency checking within local search applied to the frequency assignment with polarization problem.

Michel Vasquez, Audrey Dupont, Djamal Habet

RAIRO Oper. Res., 2003

Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem.

Michel Vasquez, Jin-Kao Hao

J. Comb. Optim., 2003

2002

A Hybrid Approach for SAT.

Djamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez

Proceedings of the Principles and Practice of Constraint Programming, 2002

2001

Une approche hybride pour le sac à dos multidimensionnel en variables 0-1.

Michel Vasquez, Jin-Kao Hao

RAIRO Oper. Res., 2001

A Heuristic Approach for Antenna Positioning in Cellular Networks.

Michel Vasquez, Jin-Kao Hao

J. Heuristics, 2001

A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite.

Michel Vasquez, Jin-Kao Hao

Comput. Optim. Appl., 2001

A Hybrid Approach for the 01 Multidimensional Knapsack problem.

Michel Vasquez, Jin-Kao Hao

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001