Markus Wagner
with Neumann · 2012–2014
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Markus Wagner trusts
Their strongest outbound trust, strongest first, inferred from their citations.
- Leo Breiman (in Statistical Learning Theory)
Papers from Markus Wagner's perspective
Ordered by how strongly the researchers Markus Wagner trusts endorse each paper. Same corpus, a different order for every researcher.
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- TSPLIB - A Traveling Salesman Problem Library
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Classification and regression trees
- Approximation Algorithms
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Exploratory landscape analysis (Annual Conference on Genetic and Evolutionary Computation)
- The Traveling Salesman Problem: A Case Study in Local Optimization
- Energy Minimizing Vehicle Routing Problem (International Conference on Combinatorial Optimization and Applications)
- Chained Lin-Kernighan for Large Traveling Salesman Problems (INFORMS journal on computing)
Their papers
- Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness (2012) — 55 citations
- A comprehensive benchmark set and heuristics for the traveling thief problem (2014) — 130 citations