Generalization of machine learning for problem reduction: a case study on travelling salesman problems
From MaRDI portal
Publication:2241908
DOI10.1007/s00291-020-00604-xzbMath1480.90215arXiv2005.05847OpenAlexW3102895825MaRDI QIDQ2241908
Jake Weiner, Xiaodong Li, Andreas T. Ernst, Yu-An Sun
Publication date: 9 November 2021
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.05847
combinatorial optimizationtravelling salesman problemmachine learninggeneralization errorproblem reduction
Related Items (3)
Boosting ant colony optimization via solution prediction and machine learning ⋮ Deep policy dynamic programming for vehicle routing problems ⋮ Learning to sparsify travelling salesman problem instances
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Transforming asymmetric into symmetric traveling salesman problems
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Learning heuristics for the TSP by policy gradient
- Support-vector networks
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- A review on algorithms for maximum clique problems
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- Edge Elimination in TSP Instances
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- TSPLIB—A Traveling Salesman Problem Library
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Generalization of machine learning for problem reduction: a case study on travelling salesman problems
