EDP Sciences logo
Authentification abonné
Rechercher
Menu

Article cité par

La fonctionnalité Article cité par… liste les citations d'un article. Ces citations proviennent de la base de données des articles de EDP Sciences, ainsi que des bases de données d'autres éditeurs participant au programme CrossRef Cited-by Linking Program. Vous pouvez définir une alerte courriel pour être prévenu de la parution d'un nouvel article citant " cet article (voir sur la page du résumé de l'article le menu à droite).

Article cité :

La vie et l’œuvre de Gérard Toulouse

Bernard Derrida, Marc Mézard, Jean-Pierre Nadal and Yves Pomeau
Comptes Rendus. Physique 26 (G1) 253 (2025)
https://doi.org/10.5802/crphys.240

Revolutionizing multi-objective interval traveling salesperson problem: A novel approach with interval arithmetic

N. Mathavan and G. Ramesh
Journal of Intelligent & Fuzzy Systems 46 (4) 7539 (2024)
https://doi.org/10.3233/JIFS-235966

Variable Neighborhood Search: The power of change and simplicity

Jack Brimberg, Said Salhi, Raca Todosijević and Dragan Urošević
Computers & Operations Research 155 106221 (2023)
https://doi.org/10.1016/j.cor.2023.106221

Computational Science – ICCS 2022

Tomasz Śmierzchalski, Łukasz Pawela, Zbigniew Puchała, Tomasz Trzciński and Bartłomiej Gardas
Lecture Notes in Computer Science, Computational Science – ICCS 2022 13353 261 (2022)
https://doi.org/10.1007/978-3-031-08760-8_22

Optimal sampling strategy of water quality monitoring at high dynamic lakes: A remote sensing and spatial simulated annealing integrated approach

Jian Li, Liqiao Tian, Yihong Wang, et al.
Science of The Total Environment 777 146113 (2021)
https://doi.org/10.1016/j.scitotenv.2021.146113

Exploring energy landscapes at the DFTB quantum level using the threshold algorithm: the case of the anionic metal cluster Au$$_{20}^{-}$$

Mathias Rapacioli, J. Christian Schön and Nathalie Tarrat
Theoretical Chemistry Accounts 140 (7) (2021)
https://doi.org/10.1007/s00214-021-02748-7

The Stochastic Multipath Traveling Salesman Problem with Dependent Random Travel Costs

Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba and Roberto Tadei
Transportation Science 54 (5) 1372 (2020)
https://doi.org/10.1287/trsc.2020.0996

A Practical Methodology for Generating High-Resolution 3D Models of Open-Pit Slopes Using UAVs: Flight Path Planning and Optimization

Rushikesh Battulwar, Garrett Winkelmaier, Jorge Valencia, Masoud Zare Naghadehi, Bijan Peik, Behrooz Abbasi, Bahram Parvin and Javad Sattarvand
Remote Sensing 12 (14) 2283 (2020)
https://doi.org/10.3390/rs12142283

Nature-Inspired Computation in Navigation and Routing Problems

Aziz Ouaarab
Springer Tracts in Nature-Inspired Computing, Nature-Inspired Computation in Navigation and Routing Problems 85 (2020)
https://doi.org/10.1007/978-981-15-1842-3_4

Replica symmetry and replica symmetry breaking for the traveling salesperson problem

Hendrik Schawe, Jitesh Kumar Jha and Alexander K. Hartmann
Physical Review E 100 (3) (2019)
https://doi.org/10.1103/PhysRevE.100.032135

Average optimal cost for the Euclidean TSP in one dimension

Sergio Caracciolo, Andrea Di Gioacchino, Enrico M Malatesta and Carlo Vanoni
Journal of Physics A: Mathematical and Theoretical 52 (26) 264003 (2019)
https://doi.org/10.1088/1751-8121/ab1600

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator

Abid Hussain, Yousaf Shad Muhammad, M. Nauman Sajid, et al.
Computational Intelligence and Neuroscience 2017 1 (2017)
https://doi.org/10.1155/2017/7430125

Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem

Anis Mjirda, Raca Todosijević, Saïd Hanafi, Pierre Hansen and Nenad Mladenović
International Transactions in Operational Research 24 (3) 615 (2017)
https://doi.org/10.1111/itor.12282

Variable neighborhood search: basics and variants

Pierre Hansen, Nenad Mladenović, Raca Todosijević and Saïd Hanafi
EURO Journal on Computational Optimization 5 (3) 423 (2017)
https://doi.org/10.1007/s13675-016-0075-x

The threshold algorithm: Description of the methodology and new developments

Sridhar Neelamraju, Christina Oligschleger and J. Christian Schön
The Journal of Chemical Physics 147 (15) (2017)
https://doi.org/10.1063/1.4985912

Phase transitions in integer linear problems

S Colabrese, D De Martino, L Leuzzi and E Marinari
Journal of Statistical Mechanics: Theory and Experiment 2017 (9) 093404 (2017)
https://doi.org/10.1088/1742-5468/aa85c3

CUDAP: A Novel Clustering Algorithm for Uncertain Data Based on Approximate Backbone

Ping Jin, Shichao Qu, Yu Zong and Xin Li
Journal of Software 9 (3) (2014)
https://doi.org/10.4304/jsw.9.3.732-737

Proceedings of the Sixth International Conference on Management Science and Engineering Management

Fausto Pedro Garc’ıa M’arquez and Marta Ramos Mart’ın Nieto
Lecture Notes in Electrical Engineering, Proceedings of the Sixth International Conference on Management Science and Engineering Management 185 23 (2013)
https://doi.org/10.1007/978-1-4471-4600-1_2

An Evaluation of Methods for Estimating the Number of Local Optima in Combinatorial Optimization Problems

Leticia Hernando, Alexander Mendiburu and Jose A. Lozano
Evolutionary Computation 21 (4) 625 (2013)
https://doi.org/10.1162/EVCO_a_00100

Hardware and Software: Verification and Testing

Michael Codish, Yoav Fekete and Amit Metodi
Lecture Notes in Computer Science, Hardware and Software: Verification and Testing 8244 1 (2013)
https://doi.org/10.1007/978-3-319-03077-7_1

Evaluation of the physical annealing strategy for simulated annealing: A function-based analysis in the landscape paradigm

M. Hasegawa
Physical Review E 85 (5) (2012)
https://doi.org/10.1103/PhysRevE.85.056704

Verification and rectification of the physical analogy of simulated annealing for the solution of the traveling salesman problem

M. Hasegawa
Physical Review E 83 (3) (2011)
https://doi.org/10.1103/PhysRevE.83.036708

Asymptotic properties of combinatorial optimization problems in p-adic space

Mukadas D. Missarov and Roman G. Stepanov
P-Adic Numbers, Ultrametric Analysis, and Applications 3 (2) 114 (2011)
https://doi.org/10.1134/S207004661102004X

Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

Xiutang Geng, Zhihua Chen, Wei Yang, Deqian Shi and Kai Zhao
Applied Soft Computing 11 (4) 3680 (2011)
https://doi.org/10.1016/j.asoc.2011.01.039

Optimal-path cracks in correlated and uncorrelated lattices

E. A. Oliveira, K. J. Schrenk, N. A. M. Araújo, H. J. Herrmann and J. S. Andrade
Physical Review E 83 (4) (2011)
https://doi.org/10.1103/PhysRevE.83.046113

HC_AB: A new heuristic clustering algorithm based on Approximate Backbone

Yu Zong, Guandong Xu, Ping Jin, Yanchun Zhang and Enhong Chen
Information Processing Letters 111 (17) 857 (2011)
https://doi.org/10.1016/j.ipl.2011.05.020

Ubiquitous Fractal Dimension of Optimal Paths

Jose S. Andrade, Saulo D.S. Reis, Erneson A. Oliveira, Eric Fehr and Hans J. Herrmann
Computing in Science & Engineering 13 (1) 74 (2011)
https://doi.org/10.1109/MCSE.2011.16

Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times

J. Majumdar and A.K. Bhunia
Journal of Computational and Applied Mathematics 235 (9) 3063 (2011)
https://doi.org/10.1016/j.cam.2010.12.027

Ultrametricity property of energy landscapes of multidisperse packing problems

Johannes J. Schneider, André Müller and Elmar Schömer
Physical Review E 79 (3) (2009)
https://doi.org/10.1103/PhysRevE.79.031122

On the Neighborhood Structure of the Traveling Salesman Problem Generated by Local Search Moves

Günther Stattenberger, Markus Dankesreiter, Florian Baumgartner and Johannes J. Schneider
Journal of Statistical Physics 129 (4) 623 (2007)
https://doi.org/10.1007/s10955-007-9382-1

Inventory of damageable items with variable replenishment and unit production cost via simulated annealing method

Manas Kumar Maiti and Manoranjan Maiti
Computers & Industrial Engineering 49 (3) 432 (2005)
https://doi.org/10.1016/j.cie.2005.07.004

MICAI 2004: Advances in Artificial Intelligence

Horacio Martínez-Alfaro and Manuel Valenzuela-Rendón
Lecture Notes in Computer Science, MICAI 2004: Advances in Artificial Intelligence 2972 11 (2004)
https://doi.org/10.1007/978-3-540-24694-7_2

Evolutionary Computation in Combinatorial Optimization

Christian Bierwirth, Dirk Christian Mattfeld and Jean-Paul Watson
Lecture Notes in Computer Science, Evolutionary Computation in Combinatorial Optimization 3004 21 (2004)
https://doi.org/10.1007/978-3-540-24652-7_3

О задачах комбинаторной оптимизации в ультраметричных пространствах

Mukadas Dmukhtasibovich Missarov, Мукадас Дмухтасибович Миссаров, Роман Григорьевич Степанов and Roman Grigor'evich Stepanov
Теоретическая и математическая физика 136 (1) 164 (2003)
https://doi.org/10.4213/tmf209

Handbook of Metaheuristics

Pablo Moscato and Carlos Cotta
International Series in Operations Research & Management Science, Handbook of Metaheuristics 57 105 (2003)
https://doi.org/10.1007/0-306-48056-5_5

Essays and Surveys in Metaheuristics

Pedro Castro Borges and Michael Pilegaard Hansen
Operations Research/Computer Science Interfaces Series, Essays and Surveys in Metaheuristics 15 129 (2002)
https://doi.org/10.1007/978-1-4615-1507-4_6

Empirical Evidence for Ultrametric Structure in Multi-layer Perceptron Error Surfaces

Marcus Gallagher, Tom Downs and Ian Wood
Neural Processing Letters 16 (2) 177 (2002)
https://doi.org/10.1023/A:1019956303894

Universality classes for self-avoiding walks in a strongly disordered system

Lidia A. Braunstein, Sergey V. Buldyrev, Shlomo Havlin and H. Eugene Stanley
Physical Review E 65 (5) (2002)
https://doi.org/10.1103/PhysRevE.65.056128

An efficient genetic algorithm for the traveling salesman problem with precedence constraints

Chiung Moon, Jongsoo Kim, Gyunghyun Choi and Yoonho Seo
European Journal of Operational Research 140 (3) 606 (2002)
https://doi.org/10.1016/S0377-2217(01)00227-2

Optimization of the time-dependent traveling salesman problem with Monte Carlo methods

Johannes Bentner, Günter Bauer, Gustav M. Obermair, Ingo Morgenstern and Johannes Schneider
Physical Review E 64 (3) (2001)
https://doi.org/10.1103/PhysRevE.64.036701

GAVEL - a new tool for genetic algorithm visualization

E. Hart and P. Ross
IEEE Transactions on Evolutionary Computation 5 (4) 335 (2001)
https://doi.org/10.1109/4235.942528

Landscape Analyses of Search-Space in Travelling Salesman Problems

Hiroki Yoshizawa and Shuji Hashimoto
Transactions of the Japanese Society for Artificial Intelligence 16 309 (2001)
https://doi.org/10.1527/tjsai.16.309

Principles and Practice of Constraint Programming — CP 2001

Weixiong Zhang
Lecture Notes in Computer Science, Principles and Practice of Constraint Programming — CP 2001 2239 153 (2001)
https://doi.org/10.1007/3-540-45578-7_11

Parallel Problem Solving from Nature PPSN VI

Meriema Belaidouni and Jin-Kao Hao
Lecture Notes in Computer Science, Parallel Problem Solving from Nature PPSN VI 1917 49 (2000)
https://doi.org/10.1007/3-540-45356-3_5

Determining computational complexity from characteristic ‘phase transitions’

Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman and Lidror Troyansky
Nature 400 (6740) 133 (1999)
https://doi.org/10.1038/22055

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization

Cyril Fonlupt, Denis Robilliard, Philippe Preux and El-Ghazali Talbi
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization 257 (1999)
https://doi.org/10.1007/978-1-4615-5775-3_18

Optimal paths in disordered media: Scaling of the crossover from self-similar to self-affine behavior

Markus Porto, Nehemia Schwartz, Shlomo Havlin and Armin Bunde
Physical Review E 60 (3) R2448 (1999)
https://doi.org/10.1103/PhysRevE.60.R2448

Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy

Gilles Caporossi, Dragoš Cvetković, Ivan Gutman and Pierre Hansen
Journal of Chemical Information and Computer Sciences 39 (6) 984 (1999)
https://doi.org/10.1021/ci9801419

Barrier heights between ground states in a model of RNA secondary structure

Steven R Morgan and Paul G Higgs
Journal of Physics A: Mathematical and General 31 (14) 3153 (1998)
https://doi.org/10.1088/0305-4470/31/14/005

Search-space smoothing for combinatorial optimization problems

Johannes Schneider, Markus Dankesreiter, Werner Fettes, et al.
Physica A: Statistical Mechanics and its Applications 243 (1-2) 77 (1997)
https://doi.org/10.1016/S0378-4371(97)00207-0