Fetching the paper…
Reading the bibliography…
To advance capabilities of large language models (LLMs) in solving combinatorial optimization problems (COPs), this paper presents the Language-based Neural COP Solver (LNCS), a novel framework that is unified for the end-to-end resolution of diverse text-attributed COPs.
J. R. Jackson, “Scheduling a production line to minimize maximum tardiness,” Management science research project , 1955
1955
Earlier work this paper cites.
R. Bar-Yehuda and S. Even, “A local-ratio theorem for approximating the weighted vertex cover problem,” in North-Holland Mathematics Studies . Elsevier, 1985, vol. 109, pp. 27–45
1985
Earlier work this paper cites.
L. B. Pitt, A simple probabilistic approximation algorithm for vertex cover . Yale University, Department of Computer Science, 1985
1985
Earlier work this paper cites.
R. J. Williams, “Simple statistical gradient-following algorithms for connectionist reinforcement learning,” Machine learning , vol. 8, pp. 229–256, 1992
1992
Earlier work this paper cites.
C. Blum and A. Roli, “Metaheuristics in combinatorial optimization: Overview and conceptual comparison,” ACM Computing Surveys , vol. 35, no. 3, p. 268–308, sep 2003
2003
Earlier work this paper cites.
O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” Advances in neural information processing systems , vol. 28, 2015
2015
Earlier work this paper cites.
S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” in International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, vol. 37. PMLR, 2015, pp. 448–456
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2016
2016
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” Advances in neural information processing systems , vol. 30, 2017
2017
Earlier work this paper cites.
W. Kool, H. van Hoof, and M. Welling, “Attention, learn to solve routing problems!” in International Conference on Learning Representations , 2018
2018
Earlier work this paper cites.
J. Rasku, T. Kärkkäinen, and N. Musliu, “Meta-survey and implementations of classical capacitated vehicle routing heuristics with reproduced results,” Toward Automatic Customization of Vehicle Routing Systems , pp. 133–260, 2019
2019
Earlier work this paper cites.
N. Reimers and I. Gurevych, “Sentence-bert: Sentence embeddings using siamese bert-networks,” in Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) , 2019, pp. 3982–3992
2019
Earlier work this paper cites.
Y.-D. Kwon, J. Choo, B. Kim, I. Yoon, Y. Gwon, and S. Min, “Pomo: Policy optimization with multiple optima for reinforcement learning,” Advances in Neural Information Processing Systems , vol. 33, pp. 21 188–21 198, 2020
2020
Earlier work this paper cites.
T. Yu, S. Kumar, A. Gupta, S. Levine, K. Hausman, and C. Finn, “Gradient surgery for multi-task learning,” Advances in Neural Information Processing Systems , vol. 33, pp. 5824–5836, 2020
2020
Earlier work this paper cites.
2021
Earlier work this paper cites.
Y. Bengio, A. Lodi, and A. Prouvost, “Machine learning for combinatorial optimization: a methodological tour d’horizon,” European Journal of Operational Research , vol. 290, no. 2, pp. 405–421, 2021
2021
Earlier work this paper cites.
A. Hottung, Y.-D. Kwon, and K. Tierney, “Efficient active search for combinatorial optimization problems,” in International Conference on Learning Representations , 2021
2021
Earlier work this paper cites.
B. Hudson, Q. Li, M. Malencia, and A. Prorok, “Graph neural network guided local search for the traveling salesperson problem,” in International Conference on Learning Representations , 2021
2021
Cited alongside, same era.
S. Li, Z. Yan, and C. Wu, “Learning to delegate for large-scale vehicle routing,” Advances in Neural Information Processing Systems , vol. 34, pp. 26 198–26 211, 2021
2021
Cited alongside, same era.
B. Liu, X. Liu, X. Jin, P. Stone, and Q. Liu, “Conflict-averse gradient descent for multi-task learning,” Advances in Neural Information Processing Systems , vol. 34, pp. 18 878–18 890, 2021
2021
Cited alongside, same era.
M. Kim, J. Park, and J. Park, “Sym-nco: Leveraging symmetricity for neural combinatorial optimization,” Advances in Neural Information Processing Systems , vol. 35, pp. 1936–1949, 2022
2022
Cited alongside, same era.
Y. Zhao, Y. Long, H. Liu, R. Kamoi, L. Nan, L. Chen, Y. Liu, X. Tang, R. Zhang, and A. Cohan, “DocMath-eval: Evaluating math reasoning capabilities of LLMs in understanding long and specialized documents,” in Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics , 2024, pp. 16 103–16 120
2024
Closest in time.
2024
Closest in time.
Z. Iklassov, Y. Du, F. Akimov, and M. Takac, “Self-guiding exploration for combinatorial problems,” Advances in Neural Information Processing Systems , vol. 37, 2024
2024
Closest in time.
2024
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Qiu, Z. Sun, and Y. Yang, “Dimes: A differentiable meta solver for combinatorial optimization problems,” Advances in Neural Information Processing Systems , vol. 35, pp. 25 531–25 546, 2022
2022
Cited alongside, same era.
J. Choo, Y.-D. Kwon, J. Kim, J. Jae, A. Hottung, K. Tierney, and Y. Gwon, “Simulation-guided beam search for neural combinatorial optimization,” Advances in Neural Information Processing Systems , vol. 35, pp. 8760–8772, 2022
2022
Cited alongside, same era.
Y. Wu, W. Song, Z. Cao, J. Zhang, and A. Lim, “Learning improvement heuristics for solving routing problems,” IEEE Transactions on Neural Networks and Learning Systems , vol. 33, no. 9, pp. 5057–5069, 2022
2022
Cited alongside, same era.
Y. Ma, J. Li, Z. Cao, W. Song, H. Guo, Y. Gong, and Y. M. Chee, “Efficient neural neighborhood search for pickup and delivery problems,” in International Joint Conference on Artificial Intelligence , 2022, pp. 4776–4784
2022
Cited alongside, same era.
2022
Cited alongside, same era.
2023
Cited alongside, same era.
F. Zhang, B. Chen, Y. Zhang, J. Keung, J. Liu, D. Zan, Y. Mao, J.-G. Lou, and W. Chen, “RepoCoder: Repository-level code completion through iterative retrieval and generation,” in Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing , Dec. 2023, pp. 2471–2484
2023
Cited alongside, same era.
C. Yang, X. Wang, Y. Lu, H. Liu, Q. V. Le, D. Zhou, and X. Chen, “Large language models as optimizers,” in The Twelfth International Conference on Learning Representations , 2023
2023
Cited alongside, same era.
A. Zolnai-Lucas, J. Boylan, C. Hokamp, and P. Ghaffari, “STAGE: Simplified text-attributed graph embeddings using pre-trained LLMs,” in Proceedings of the 1st Workshop on Knowledge Graphs and Large Language Models (KaLLM 2024) , Aug. 2024, pp. 92–104
2024
Closest in time.
H. Liu, J. Feng, L. Kong, N. Liang, D. Tao, Y. Chen, and M. Zhang, “One for all: Towards training one graph model for all classification tasks,” in The Twelfth International Conference on Learning Representations , 2024
2024
Closest in time.
B. Romera-Paredes, M. Barekatain, A. Novikov, M. Balog, M. P. Kumar, E. Dupont, F. J. Ruiz, J. S. Ellenberg, P. Wang, O. Fawzi et al. , “Mathematical discoveries from program search with large language models,” Nature , vol. 625, no. 7995, pp. 468–475, 2024
2024
Closest in time.
2024
Closest in time.
H. Ye, J. Wang, Z. Cao, F. Berto, C. Hua, H. Kim, J. Park, and G. Song, “Reevo: Large language models as hyper-heuristics with reflective evolution,” in Advances in Neural Information Processing Systems , 2024, https://github.com/ai4co/reevo
2024
Closest in time.
Z. Xiao, D. Zhang, Y. Wu, L. Xu, Y. J. Wang, X. Han, X. Fu, T. Zhong, J. Zeng, M. Song, and G. Chen, “Chain-of-experts: When LLMs meet complex operations research problems,” in The Twelfth International Conference on Learning Representations , 2024. [Online]. Available: https://openreview.net/forum?id=HobyL1B9CZ
2024
Closest in time.
J. Zhang, W. Wang, S. Guo, L. Wang, F. Lin, C. Yang, and W. Yin, “Solving general natural-language-description optimization problems with large language models,” in Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies , Jun. 2024, pp. 483–490
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
S. Liu, C. Chen, X. Qu, K. Tang, and Y.-S. Ong, “Large language models as evolutionary optimizers,” in 2024 IEEE Congress on Evolutionary Computation (CEC) . IEEE, 2024, pp. 1–8
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
H. Ye, J. Wang, Z. Cao, H. Liang, and Y. Li, “Deepaco: Neural-enhanced ant systems for combinatorial optimization,” Advances in Neural Information Processing Systems , vol. 36, 2024
2024
Closest in time.