Cited in
(only showing first 100 items - show all)- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
- Visiting near-optimal solutions using local search algorithms
- Comparison of tabu/2-opt heuristic and optimal tree search method for assignment problems
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
- Chained Lin-Kernighan for large traveling salesman problems
- Special frequency quadrilaterals and an application
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- The parallel drone scheduling problem with multiple drones and vehicles
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Generating subtour elimination constraints for the TSP from pure integer solutions
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
- Knowledge-guided local search for the vehicle routing problem
- Solving the traveling salesman problem with interdiction and fortification
- Dynamical Systems Theory and Algorithms for NP-hard Problems
- Sequencing and scheduling for filling lines in dairy production
- A genetic algorithm for a green vehicle routing problem
- Evolving test instances of the Hamiltonian completion problem
- Optimal TSP tour length estimation using Sammon maps
- The salesman and the tree: the importance of search in CP
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Computing compatible tours for the symmetric traveling salesman problem
- A framework for analyzing sub-optimal performance of local search algorithms
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- scientific article; zbMATH DE number 2064413 (Why is no real title available?)
- Change ringing and Hamiltonian cycles: the search for Erin and Stedman triples
- The generalized covering salesman problem
- A novel bio-inspired approach based on the behavior of mosquitoes
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
- Efficiently solving very large-scale routing problems
- Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
- Heavy-tails and randomized restarting beam search in goal-oriented neural sequence decoding
- An iterated local search for the traveling salesman problem with release dates and completion time minimization
- Improved filtering for weighted circuit constraints
- Algorithm runtime prediction: methods \& evaluation
- Optimal TSP tour length estimation using standard deviation as a predictor
- Locating a cycle in a transportation or a telecommunications network
- Using Markov chains to analyze the effectiveness of local search algorithms
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Heuristiques pour le Problème du Vendeurm-Péripatétique
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- A tolerance-based heuristic approach for the weighted independent set problem
- scientific article; zbMATH DE number 2064412 (Why is no real title available?)
- Continuous relaxations for the traveling salesman problem
- Optimization of logistics services in hospitals
- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
- Pattern discrete and mixed hit-and-run for global optimization
- A study on the effect of the asymmetry on real capacitated vehicle routing problems
- Finite-time performance analysis of static simulated annealing algorithms
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
- Multiprogramming genetic algorithm for optimization problems with permutation property
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- Tabu search for the time-dependent vehicle routing problem with time windows on a road network
- Routing automated lane-guided transport vehicles in a warehouse handling returns
- Efficient heuristics for Median Cycle Problems
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem
- A distribution-free TSP tour length estimation model for random graphs
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
- The k-dissimilar vehicle routing problem
- The multi-compartment vehicle routing problem with flexible compartment sizes
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Determination of the candidate arc set for the asymmetric traveling salesman problem
- A fresh look at the traveling salesman problem with a center
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
- Synchronized routing of seasonal products through a production/distribution network
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- A two-phase solution algorithm for the flexible periodic vehicle routing problem
- The petrol station replenishment problem with time windows
- Solving large batches of traveling salesman problems with parallel and distributed computing
- A survey of the standard location-routing problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- GRASP
- TSPLIB
- VRPH
- BIANCA
- RAMP
- Concorde
- BG-WalkSAT
- TSPTW
- TSP software
- simannf90
- Scatter Search
- VRP
- GATE
- Cardinal
- PLplot
- RngSteam
- Traveling salesman problems with PageRank distance on complex networks reveal community structure
This page was built for software: LKH
