Machine learning constructives and local searches for the travelling salesman problem
From MaRDI portal
Publication:6606630
DOI10.1007/978-3-031-08623-6_10MaRDI QIDQ6606630
Umberto Junior Mele, Tommaso Vitali, Luca Maria Gambardella, Roberto Montemanni
Publication date: 17 September 2024
combinatorial optimizationartificial intelligencetravelling salesman problemmachine learninghybrid heuristic
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Dual coordinate descent methods for logistic regression and maximum entropy models
- Large-step Markov chains for the TSP incorporating local search heuristics
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Learning to sparsify travelling salesman problem instances
- Two algorithms for constructing a Delaunay triangulation
- TSPLIB—A Traveling Salesman Problem Library
This page was built for publication: Machine learning constructives and local searches for the travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606630)
