• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 42 matches

• 2024
• 
  Matthieu Basseur, Arnaud Liefooghe, Sara Tari:
  MOW-P: A Simple yet Efficient Partial Neighborhood Walk for Multiobjective Optimization. CEC 2024: 1-8
• 
  Rong-Qiang Zeng, Matthieu Basseur, Li-Yuan Xue:
  Multi-objective Path Relinking Algorithm for Solving Bi-objective Flowshop Scheduling Problem. ICIC (1) 2024: 159-168
• 2023
• 
  Sara Tari, Matthieu Basseur, Adrien Goëffon:
  Expansion-based Hill-climbing. Inf. Sci. 649: 119635 (2023)
• 
  Sara Tari, Gabriela Ochoa, Matthieu Basseur, Sébastien Vérel:
  On the Global Structure of PUBOi Fitness Landscapes. GECCO Companion 2023: 247-250
• 
  Rong-Qiang Zeng, Li-Yuan Xue, Matthieu Basseur:
  Detecting Community Structure in Complex Networks with Backbone Guided Search Algorithm. ICIC (1) 2023: 59-67
• 2022
• 
  Sara Tari, Matthieu Basseur, Adrien Goëffon:
  Partial neighborhood local searches. Int. Trans. Oper. Res. 29(5): 2761-2788 (2022)
• 
  Rong-Qiang Zeng, Matthieu Basseur:
  Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem. ICIC (1) 2022: 123-131
• 2021
• 
  Sara Tari, Matthieu Basseur, Adrien Goëffon:
  On the use of (1, λ )-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis. Nat. Comput. 20(3): 345-361 (2021)
• 2019
• 
  Brahim Chabane, Matthieu Basseur, Jin-Kao Hao:
  Lorenz dominance based algorithms to solve a practical multiobjective problem. Comput. Oper. Res. 104: 1-14 (2019)
• 2018
• 
  Imen Ben Mansour, Matthieu Basseur, Frédéric Saubion:
  A multi-population algorithm for multi-objective knapsack problem. Appl. Soft Comput. 70: 814-825 (2018)
• 
  Sara Tari, Matthieu Basseur, Adrien Goëffon:
  Worst Improvement Based Iterated Local Search. EvoCOP 2018: 50-66
• 2017
• 
  Brahim Chabane, Matthieu Basseur, Jin-Kao Hao:
  R2-IBMOLS applied to a practical case of the multiobjective knapsack problem. Expert Syst. Appl. 71: 457-468 (2017)
• 
  Sara Tari, Matthieu Basseur, Adrien Goëffon:
  Sampled Walk and Binary Fitness Landscapes Exploration. Artificial Evolution 2017: 47-57
• 2016
• 
  Matthieu Basseur, Bilel Derbel, Adrien Goëffon, Arnaud Liefooghe:
  Experiments on Greedy and Local Search Heuristics for ddimensional Hypervolume Subset Selection. GECCO 2016: 541-548
• 
  Sara Tari, Matthieu Basseur, Adrien Goëffon:
  Toward the Design of Efficient Pivoting Rules for Local Search. GECCO (Companion) 2016: 55-56
• 2015
• 
  Matthieu Basseur, Adrien Goëffon:
  Climbing combinatorial fitness landscapes. Appl. Soft Comput. 30: 688-704 (2015)
• 
  Matthieu Basseur, Adrien Goëffon, Hugo Traverson:
  Exploring Non-neutral Landscapes with Neutrality-Based Local Search. LION 2015: 165-169
• 
  Brahim Chabane, Matthieu Basseur, Jin-Kao Hao:
  A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis. LION 2015: 249-255
• 
  Pierre Desport, Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
  Empirical Analysis of Operators for Permutation Based Problems. LION 2015: 137-150
• 2014
• 
  Matthieu Basseur:
  Analyse et conception de recherches locales génériques pour l'optimisation combinatoire à un ou plusieurs objectifs. University of Angers, France, 2014
• 
  Matthieu Basseur, Adrien Goëffon:
  On the efficiency of worst improvement for climbing NK-landscapes. GECCO 2014: 413-420
• 
  Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion, Vincent Vigneron:
  On the Attainability of NK Landscapes Global Optima. SOCS 2014: 28-34
• 2013
• 
  Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao:
  Solving bi-objective flow shop problem with hybrid path relinking algorithm. Appl. Soft Comput. 13(10): 4118-4132 (2013)
• 
  Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao:
  Hypervolume-Based Multi-Objective Path Relinking Algorithm. EMO 2013: 185-199
• 
  Matthieu Basseur, Adrien Goëffon:
  Hill-climbing strategies on various landscapes: an empirical comparison. GECCO 2013: 479-486
• 
  Matthieu Basseur, Adrien Goëffon, Arnaud Liefooghe, Sébastien Vérel:
  On set-based local search for multiobjective combinatorial optimization. GECCO 2013: 471-478
• 
  Matthieu Basseur, Adrien Goëffon:
  Hill-Climbing Behavior on Quantized NK-Landscapes. LION 2013: 209-214
• 2012
• 
  Arnaud Liefooghe, Matthieu Basseur, Jérémie Humeau, Laetitia Jourdan, El-Ghazali Talbi:
  On optimizing a bi-objective flowshop scheduling problem in an uncertain environment. Comput. Math. Appl. 64(12): 3747-3762 (2012)
• 
  Matthieu Basseur, Arnaud Liefooghe, Khoi N. Le, Edmund K. Burke:
  The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. J. Heuristics 18(2): 263-296 (2012)
• 
  El-Ghazali Talbi, Matthieu Basseur, Antonio J. Nebro, Enrique Alba:
  Multi-objective optimization using metaheuristics: non-standard algorithms. Int. Trans. Oper. Res. 19(1-2): 283-305 (2012)

skipping 12 more matches