LKH
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- ALNS
- LKH3
- CSGNet
- SeaPearl
- HGS-CVRP
- CAPOPT
- ACVIZ
- HHBQP
- TSPLIB
- VRPH
- GRASP
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- BIANCA
- RAMP
- Traveling salesman problems with PageRank distance on complex networks reveal community structure
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- An iterated local search for the traveling salesman problem with release dates and completion time minimization
- 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
- Solving large batches of traveling salesman problems with parallel and distributed computing
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- A two-phase solution algorithm for the flexible periodic vehicle routing problem
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- Extending single tolerances to set tolerances
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- TSPTW
- TSP software
- Concorde
- Utilizing individual picker skills to improve order batching in a warehouse
- Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
- An ILP-based local search procedure for the VRP with pickups and deliveries
- A survey of the standard location-routing problem
- A note on using the resistance-distance matrix to solve Hamiltonian cycle problem
- BG-WalkSAT
- simannf90
- 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
- VRP
- 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
- A genetic algorithm for a green vehicle routing problem
- Scatter Search
- The traveling purchaser problem and its variants
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- A study on the effect of the asymmetry on real capacitated vehicle routing problems
- Lower tolerance-based branch and bound algorithms for the ATSP
- Exact algorithms for the order picking problem
- GATE
- Embedded local search approaches for routing optimization
- Cardinal
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- PLplot
- RngSteam
- TTTPLOTS
- race
- 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
- Tabu search
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Neural large neighborhood search for routing problems
- Analyzing the performance of TSP solver methods
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- Evolving test instances of the Hamiltonian completion problem
- The parallel drone scheduling problem with multiple drones and vehicles
- Heavy-tails and randomized restarting beam search in goal-oriented neural sequence decoding
- Learning to sparsify travelling salesman problem instances
- Hybrid search with neighborhood reduction for the multiple 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
- Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- Improving the robustness of EPS to solve the TSP
- Deep policy dynamic programming for vehicle routing problems
- An approximation algorithm for graph partitioning via deterministic annealing neural network
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- A linearithmic heuristic for the travelling salesman problem
- A tolerance-based heuristic approach for the weighted independent set problem
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization
- The split delivery vehicle routing problem with three-dimensional loading constraints
- Continuous relaxations for the traveling salesman problem
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
- ACOTSP
- Dynamic traveling salesman problem with stochastic release dates
- BBMCL
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
- Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
- OsiSolver
This page was built for software: LKH
