default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrien Goëffon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Olivier Goudet
, Adrien Goëffon, Jin-Kao Hao:
A large population island framework for the unconstrained binary quadratic problem. Comput. Oper. Res. 168: 106684 (2024)- [c31]Olivier Goudet, Mohamed Salim Amri Sakhri, Adrien Goëffon, Frédéric Saubion:
Emergence of New Local Search Algorithms with Neuro-Evolution. EvoStar 2024: 33-48 - [c30]Olivier Goudet, Adrien Goëffon, Frédéric Saubion, Sébastien Vérel:
Emergence of Strategies for Univariate Estimation-of-Distribution Algorithms with Evolved Neural Networks. GECCO Companion 2024: 195-198 - 2023
- [j9]Sara Tari, Matthieu Basseur, Adrien Goëffon:
Expansion-based Hill-climbing. Inf. Sci. 649: 119635 (2023) - 2022
- [j8]Vincent Hénaux, Adrien Goëffon, Frédéric Saubion:
From fitness landscapes evolution to automatic local search algorithm generation. Int. Trans. Oper. Res. 29(5): 2737-2760 (2022) - [j7]Sara Tari, Matthieu Basseur, Adrien Goëffon:
Partial neighborhood local searches. Int. Trans. Oper. Res. 29(5): 2761-2788 (2022) - 2021
- [j6]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) - 2020
- [c29]Vincent Hénaux, Adrien Goëffon, Frédéric Saubion:
Evolving search trajectories. GECCO Companion 2020: 101-102 - [c28]Vincent Hénaux, Adrien Goëffon, Frédéric Saubion:
Evolution of Deterministic Hill-climbers. ICTAI 2020: 564-571
2010 – 2019
- 2019
- [c27]Vincent Hénaux, Adrien Goëffon, Frédéric Saubion:
Evolving Fitness Landscapes with Complementary Fitness Functions. EA 2019: 110-120 - 2018
- [c26]Sara Tari, Matthieu Basseur, Adrien Goëffon:
Worst Improvement Based Iterated Local Search. EvoCOP 2018: 50-66 - 2017
- [j5]Yi Zhou, Jin-Kao Hao, Adrien Goëffon:
PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem. Eur. J. Oper. Res. 257(1): 41-54 (2017) - [c25]Sara Tari, Matthieu Basseur, Adrien Goëffon:
Sampled Walk and Binary Fitness Landscapes Exploration. Artificial Evolution 2017: 47-57 - 2016
- [j4]Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
Simulating non-stationary operators in search algorithms. Appl. Soft Comput. 38: 257-268 (2016) - [j3]Yi Zhou, Jin-Kao Hao, Adrien Goëffon:
A three-phased local search approach for the clique partitioning problem. J. Comb. Optim. 32(2): 469-491 (2016) - [c24]Sara Tari, Matthieu Basseur, Adrien Goëffon:
Toward the Design of Efficient Pivoting Rules for Local Search. GECCO (Companion) 2016: 55-56 - [c23]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 - 2015
- [j2]Matthieu Basseur, Adrien Goëffon:
Climbing combinatorial fitness landscapes. Appl. Soft Comput. 30: 688-704 (2015) - [c22]Jorge Alberto Soria-Alcaraz, Gabriela Ochoa, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
Combining Mutation and Recombination to Improve a Distributed Model of Adaptive Operator Selection. Artificial Evolution 2015: 97-108 - [c21]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 - [c20]Matthieu Basseur, Adrien Goëffon, Hugo Traverson:
Exploring Non-neutral Landscapes with Neutrality-Based Local Search. LION 2015: 165-169 - 2014
- [c19]Matthieu Basseur, Adrien Goëffon:
On the efficiency of worst improvement for climbing NK-landscapes. GECCO 2014: 413-420 - [c18]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 - [i1]Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
Simulating Non Stationary Operators in Search Algorithms. CoRR abs/1409.1686 (2014) - 2013
- [c17]Matthieu Basseur, Adrien Goëffon, Arnaud Liefooghe, Sébastien Vérel:
On set-based local search for multiobjective combinatorial optimization. GECCO 2013: 471-478 - [c16]Matthieu Basseur, Adrien Goëffon:
Hill-climbing strategies on various landscapes: an empirical comparison. GECCO 2013: 479-486 - [c15]Caner Candan, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
Non stationary operator selection with island models. GECCO 2013: 1509-1516 - [c14]Matthieu Basseur, Adrien Goëffon:
Hill-Climbing Behavior on Quantized NK-Landscapes. LION 2013: 209-214 - [c13]Caner Candan, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
Parameter Setting with Dynamic Island Models. LION 2013: 253-258 - 2012
- [c12]Caner Candan, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
A dynamic island model for adaptive operator selection. GECCO 2012: 1253-1260 - [c11]Adrien Goëffon, Frédéric Lardeux:
Autonomous Local Search Algorithms with Island Representation. LION 2012: 390-395 - [c10]Fabien Chhel, Frédéric Lardeux, Adrien Goëffon, Frédéric Saubion:
Minimum multiple characterization of biological data using partially defined boolean formulas. SAC 2012: 1399-1405 - 2011
- [c9]Fabien Chhel, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion, Gilles Hunault, Tristan Boureau:
Experimental Approach for Bacterial Strains Characterization. EvoBio 2011: 135-140 - [c8]Adrien Goëffon, Frédéric Lardeux:
Optimal One-Max Strategy with Dynamic Island Models. ICTAI 2011: 485-488 - [c7]Fabien Chhel, Adrien Goëffon, Antoine Lafosse, Frédéric Lardeux, Frédéric Saubion, Gilles Hunault, Tristan Boureau:
The bacterial strains characterization problem. SAC 2011: 108-109 - 2010
- [c6]Frédéric Lardeux, Adrien Goëffon:
A Dynamic Island-Based Genetic Algorithms Framework. SEAL 2010: 156-165
2000 – 2009
- 2009
- [c5]Jean-Michel Richer, Adrien Goëffon, Jin-Kao Hao:
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony. EvoBIO 2009: 164-175 - [c4]Nikolay Vyahhi, Adrien Goëffon, Macha Nikolski, David James Sherman:
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios. GECCO 2009: 241-246 - 2008
- [j1]Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao:
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 5(1): 136-145 (2008) - [c3]Adrien Goëffon, Macha Nikolski, David James Sherman:
An efficient probabilistic population-based descent for the median genome problem. GECCO 2008: 315-322 - 2006
- [b1]Adrien Goëffon:
Nouvelles heuristiques de voisinage et mémétiques pour le problème Maximum de Parcimonie. (New neighborhood and memetic heuristics for theMaximum Parsimony problem). University of Angers, France, 2006 - [c2]Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao:
A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem. PPSN 2006: 761-770 - 2005
- [c1]Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao:
Local Search for the Maximum Parsimony Problem. ICNC (3) 2005: 678-683
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-08-23 19:25 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:
