Fetching the paper…
Reading the bibliography…
Heuristics are widely used for dealing with complex search and optimization problems.
A heuristic algorithm for the n job, m machine sequencing problem
Campbell, H. G., Dudek, R. A., and Smith, M. L · 1970
Earlier work this paper cites.
A functional heuristic algorithm for the flowshop scheduling problem
Gupta, J. N · 1971
Earlier work this paper cites.
An analysis of several heuristics for the traveling salesman problem
Rosenkrantz, D. J., Stearns, R. E., and Lewis, II, P. M · 1977
Earlier work this paper cites.
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
Nawaz, M., Enscore Jr, E. E., and Ham, I · 1983
Earlier work this paper cites.
Simulated annealing
Van Laarhoven, P. J., Aarts, E. H., van Laarhoven, P. J., and Aarts, E. H · 1987
Earlier work this paper cites.
Lower bounds and reduction procedures for the bin packing problem
Martello, S. and Toth, P · 1990
Earlier work this paper cites.
Tsplib—a traveling salesman problem library
Reinelt, G · 1991
Earlier work this paper cites.
Benchmarks for basic scheduling problems
Taillard, E · 1993
Earlier work this paper cites.
Handbook of evolutionary computation
Bäck, T., Fogel, D. B., and Michalewicz, Z · 1997
Earlier work this paper cites.
Tabu search
Glover, F. and Laguna, M · 1998
Earlier work this paper cites.
Applying iterated local search to the permutation flow shop problem
Stützle, T · 1998
Earlier work this paper cites.
Guided local search and its application to the traveling salesman problem
Voudouris, C. and Tsang, E · 1999
Earlier work this paper cites.
On the online bin packing problem
Seiden, S. S · 2002
Earlier work this paper cites.
Iterated local search
Lourenço, H. R., Martin, O. C., and Stützle, T · 2003
Earlier work this paper cites.
Concorde tsp solver, 2006
Applegate, D., Bixby, R., Chvatal, V., and Cook, W · 2006
Earlier work this paper cites.
Traveling salesman problem: an overview of applications, formulations, and solution approaches
Matai, R., Singh, S. P., and Mittal, M. L · 2010
Earlier work this paper cites.
Open issues in genetic programming
O’Neill, M., Vanneschi, L., Gustafson, S., and Banzhaf, W · 2010
Earlier work this paper cites.
Sequential model-based optimization for general algorithm configuration
Hutter, F., Hoos, H. H., and Leyton-Brown, K · 2011
Earlier work this paper cites.
Flow shop scheduling: theoretical results, algorithms, and applications , volume 182
Emmons, H. and Vairaktarakis, G · 2012
Earlier work this paper cites.
Hyper-heuristics: A survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., and Qu, R · 2013
Earlier work this paper cites.
Foundations of genetic programming
Langdon, W. B. and Poli, R · 2013
Earlier work this paper cites.
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
Fernandez-Viagas, V. and Framinan, J. M · 2014
Earlier work this paper cites.
From evolutionary computation to the evolution of things
Eiben, A. E. and Smith, J · 2015
Earlier work this paper cites.
Pointer networks
Vinyals, O., Fortunato, M., and Jaitly, N · 2015
Earlier work this paper cites.
Neural combinatorial optimization with reinforcement learning
Bello, I., Pham, H., Le, Q. V., Norouzi, M., and Bengio, S · 2016
Earlier work this paper cites.
Mo-paramils: A multi-objective automatic algorithm configuration framework
Blot, A., Hoos, H. H., Jourdan, L., Kessaci-Marmion, M.-É., and Trautmann, H · 2016
Earlier work this paper cites.
The irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L. P., Birattari, M., and Stützle, T · 2016
Earlier work this paper cites.
An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems
Helsgaun, K · 2017
Earlier work this paper cites.
Guided local search., 2018
Alsheddy, A., Voudouris, C., Tsang, E. P., and Alhindi, A · 2018
Cited alongside, same era.
Learning heuristics for the tsp by policy gradient
Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., and Rousseau, L.-M · 2018
Cited alongside, same era.
Attention, learn to solve routing problems!
Kool, W., Van Hoof, H., and Welling, M · 2018
Cited alongside, same era.
Handbook of heuristics
Mart, R., Pardalos, P. M., and Resende, M. G · 2018
Cited alongside, same era.
Eb-gls: an improved guided local search based on the big valley structure
Shi, J., Zhang, Q., and Tsang, E · 2018
Cited alongside, same era.
Optuna: A next-generation hyperparameter optimization framework
Akiba, T., Sano, S., Yanase, T., Ohta, T., and Koyama, M · 2019
Chain-of-thought prompting elicits reasoning in large language models
Wei, J., Wang, X., Schuurmans, D., Bosma, M., Xia, F., Chi, E., Le, Q. V., Zhou, D., et al · 2022
Later among the works it cites.
Online bin packing with predictions
Angelopoulos, S., Kamali, S., and Shadkami, K · 2023
Later among the works it cites.
Evoprompting: Language models for code-level neural architecture search
Chen, A., Dohan, D., and So, D · 2023
Later among the works it cites.
A survey of chain of thought reasoning: Advances, frontiers and future
Chu, Z., Chen, J., Chen, Q., Yu, W., He, T., Wang, H., Peng, W., Liu, M., Qin, B., and Liu, T · 2023
Later among the works it cites.
Bq-nco: Bisimulation quotienting for generalizable neural combinatorial optimization
Drakulic, D., Michel, S., Mai, F., Sors, A., and Andreoli, J.-M · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Knowledge-guided local search for the vehicle routing problem
Arnold, F. and Sörensen, K · 2019
Cited alongside, same era.
A classification of hyper-heuristic approaches: revisited
Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Özcan, E., and Woodward, J. R · 2019
Cited alongside, same era.
An efficient graph convolutional network technique for the travelling salesman problem
Joshi, C. K., Laurent, T., and Bresson, X · 2019
Cited alongside, same era.
Automated design of metaheuristic algorithms
Stützle, T. and López-Ibáñez, M · 2019
Cited alongside, same era.
Pomo: Policy optimization with multiple optima for reinforcement learning
Kwon, Y.-D., Choo, J., Kim, B., Yoon, I., Gwon, Y., and Min, S · 2020
Cited alongside, same era.
Step-wise deep learning models for solving routing problems
Xin, L., Song, W., Cao, Z., and Zhang, J · 2020
Cited alongside, same era.
Promptbreeder: Self-referential self-improvement via prompt evolution
Fernando, C., Banarse, D., Michalewski, H., Osindero, S., and Rocktäschel, T · 2023
Later among the works it cites.
Evolution through large models
Lehman, J., Gordon, J., Jain, S., Ndousse, K., Yeh, C., and Stanley, K. O · 2023
Later among the works it cites.
Fully autonomous programming with large language models
Liventsev, V., Grishina, A., Härmä, A., and Moonen, L · 2023
Later among the works it cites.
Large language model guided tree-of-thought
Long, J · 2023
Later among the works it cites.
Neural combinatorial optimization with heavy decoder: Toward large scale generalization
Luo, F., Lin, X., Liu, F., Zhang, Q., and Wang, Z · 2023
Later among the works it cites.
Eureka: Human-level reward design via coding large language models
Ma, Y. J., Liang, W., Wang, G., Huang, D.-A., Bastani, O., Jayaraman, D., Zhu, Y., Fan, L., and Anandkumar, A · 2023
Later among the works it cites.
Dissociating language and thought in large language models: a cognitive perspective
Mahowald, K., Ivanova, A. A., Blank, I. A., Kanwisher, N., Tenenbaum, J. B., and Fedorenko, E · 2023
Later among the works it cites.
Language model crossover: Variation through few-shot prompting
Meyerson, E., Nelson, M. J., Bradley, H., Moradi, A., Hoover, A. K., and Lehman, J · 2023
Later among the works it cites.
Llmatic: Neural architecture search via large language models and quality-diversity optimization
Nasir, M. U., Earle, S., Togelius, J., James, S., and Cleghorn, C · 2023
Later among the works it cites.
A comprehensive overview of large language models
Naveed, H., Khan, A. U., Qiu, S., Saqib, M., Anwar, S., Usman, M., Barnes, N., and Mian, A · 2023
Later among the works it cites.
Algorithm of thoughts: Enhancing exploration of ideas in large language models
Sel, B., Al-Tawaha, A., Khattar, V., Wang, L., Jia, R., and Jin, M · 2023
Later among the works it cites.
Navigation with large language models: Semantic guesswork as a heuristic for planning
Shah, D., Equi, M. R., Osiński, B., Xia, F., Ichter, B., and Levine, S · 2023
Later among the works it cites.
Neuralgls: learning to guide local search with graph convolutional network for the traveling salesman problem
Sui, J., Ding, S., Xia, B., Liu, R., and Bu, D · 2023
Later among the works it cites.
As-llm: When algorithm selection meets large language model
Wu, X., Zhong, Y., Wu, J., and Tan, K. C · 2023
Later among the works it cites.
Llm a*: Human in the loop large language models enabled a* search for robotics
Xiao, H. and Wang, P · 2023
Later among the works it cites.
Large language models as optimizers
Yang, C., Wang, X., Lu, Y., Liu, H., Le, Q. V., Zhou, D., and Chen, X · 2023
Later among the works it cites.
Beyond chain-of-thought, effective graph-of-thought reasoning in large language models
Yao, Y., Li, Z., and Zhao, H · 2023
Later among the works it cites.
Survey on genetic programming and machine learning techniques for heuristic design in job shop scheduling
Zhang, F., Mei, Y., Nguyen, S., and Zhang, M · 2023
Later among the works it cites.
Evolving code with a large language model
Hemberg, E., Moskal, S., and O’Reilly, U.-M · 2024
Closest in time.
Evolution Through Large Models , pp. 331–366
Lehman, J., Gordon, J., Jain, S., Ndousse, K., Yeh, C., and Stanley, K. O · 2024
Closest in time.
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J., Ellenberg, J. S., Wang, P., Fawzi, O., et al · 2024
Closest in time.
Evolutionary computation in the era of large language model: Survey and roadmap
Wu, X., Wu, S.-h., Wu, J., Feng, L., and Tan, K. C · 2024
Closest in time.