default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Vasquez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Michel Vasquez
, Mirsad Buljubasic, Saïd Hanafi:
An efficient scenario penalization matheuristic for a stochastic scheduling problem. J. Heuristics 29(2-3): 383-408 (2023)- 2022
- [j19]Ali Yaddaden, Sébastien Harispe, Michel Vasquez:
Is Transfer Learning Helpful for Neural Combinatorial Optimization Applied to Vehicle Routing Problems? Comput. Informatics 41(1): 172-190 (2022) - [c10]Ali Yaddaden, Sébastien Harispe, Michel Vasquez:
Neural Order-First Split-Second Algorithm for the Capacitated Vehicle Routing Problem. OLA 2022: 168-185 - 2020
- [c9]Ali Yaddaden, Sébastien Harispe, Michel Vasquez, Mirsad Bukjubasic:
Apprentissage automatique pour l'optimisation combinatoire : étude du problème du voyageur de commerce. CNIA 2020: 30-37 - [c8]Jocelyn Poncelet, Pierre-Antoine Jean, Michel Vasquez, Jacky Montmain:
Hierarchical Reasoning and Knapsack Problem Modelling to Design the Ideal Assortment in Retail. IPMU (1) 2020: 201-214
2010 – 2019
- 2018
- [j18]Mirsad Buljubasic, Michel Vasquez, Haris Gavranovic:
Two-phase heuristic for SNCF rolling stock problem. Ann. Oper. Res. 271(2): 1107-1129 (2018) - 2017
- [c7]Michel Vasquez, Yannick Vimont:
On Solving the Queen Graph Coloring Problem. IWOCA 2017: 244-251 - 2016
- [j17]Mirsad Buljubasic, Michel Vasquez:
Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Comput. Oper. Res. 76: 12-21 (2016) - 2015
- [j16]Nicolas Zufferey, Michel Vasquez:
A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems. RAIRO Oper. Res. 49(1): 99-121 (2015) - 2013
- [j15]Saïd Hanafi, Ahmed Riadh Rebai, Michel Vasquez:
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems. J. Heuristics 19(4): 645-677 (2013) - 2011
- [j14]Hideki Hashimoto, Sylvain Boussier, Michel Vasquez, Christophe Wilbaut:
A GRASP-based approach for technicians and interventions scheduling for telecommunications. Ann. Oper. Res. 183(1): 143-161 (2011) - 2010
- [j13]Djamal Habet, Michel Vasquez, Yannick Vimont:
Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite. Comput. Optim. Appl. 47(2): 307-333 (2010) - [j12]Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon:
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem. Discret. Appl. Math. 158(2): 97-109 (2010)
2000 – 2009
- 2009
- [j11]Audrey Dupont, Andréa Carneiro Linhares, Christian Artigues, Dominique Feillet, Philippe Michelon, Michel Vasquez:
The dynamic frequency assignment problem. Eur. J. Oper. Res. 195(1): 75-88 (2009) - [j10]Sylvain Boussier, Hideki Hashimoto, Michel Vasquez, Christophe Wilbaut:
Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications. RAIRO Oper. Res. 43(4): 387-407 (2009) - [i2]Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon:
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search. CoRR abs/0905.0848 (2009) - 2008
- [j9]Yannick Vimont, Sylvain Boussier, Michel Vasquez:
Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem. J. Comb. Optim. 15(2): 165-178 (2008) - 2007
- [c6]Djamal Habet, Michel Vasquez:
Improving Local Search for Satisfiability Problem by Integrating Structural Properties. RIVF 2007: 50-57 - [i1]Sylvain Boussier, Hideki Hashimoto, Michel Vasquez:
A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications. CoRR abs/0709.0906 (2007) - 2005
- [j8]Michel Vasquez, Yannick Vimont:
Improved results on the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 165(1): 70-81 (2005) - 2004
- [j7]Audrey Dupont, Eric Alvernhe, Michel Vasquez:
Efficient Filtering and Tabu Search on a Consistent Neighbourhood for the Frequency Assignment Problem with Polarisation. Ann. Oper. Res. 130(1-4): 179-198 (2004) - [j6]Michel Vasquez:
New Results on the Queens_n2 Graph Coloring Problem. J. Heuristics 10(4): 407-413 (2004) - [c5]Michel Vasquez, Djamal Habet:
Complete and Incomplete Algorithms for the Queen Graph Coloring Problem. ECAI 2004: 226-230 - [c4]Djamal Habet, Michel Vasquez:
Solving the Selecting and Scheduling Satellite Photographs Problem with a Consistent Neighborhood Heuristic. ICTAI 2004: 302-309 - [c3]Michel Vasquez, Djamal Habet:
Algorithmes complet et incomplet pour la coloration des graphes de reines. JFPLC 2004 - 2003
- [j5]Michel Vasquez, Jin-Kao Hao:
Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem. J. Comb. Optim. 7(1): 87-103 (2003) - [j4]Michel Vasquez, Audrey Dupont, Djamal Habet:
Consistency checking within local search applied to the frequency assignment with polarization problem. RAIRO Oper. Res. 37(4): 311-323 (2003) - 2002
- [c2]Djamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez:
A Hybrid Approach for SAT. CP 2002: 172-184 - 2001
- [j3]Michel Vasquez, Jin-Kao Hao:
A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. Comput. Optim. Appl. 20(2): 137-157 (2001) - [j2]Michel Vasquez, Jin-Kao Hao:
A Heuristic Approach for Antenna Positioning in Cellular Networks. J. Heuristics 7(5): 443-472 (2001) - [j1]Michel Vasquez, Jin-Kao Hao:
Une approche hybride pour le sac à dos multidimensionnel en variables 0-1. RAIRO Oper. Res. 35(4): 415-438 (2001) - [c1]Michel Vasquez, Jin-Kao Hao:
A Hybrid Approach for the 01 Multidimensional Knapsack problem. IJCAI 2001: 328-333
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
