Pages that link to "Item:Q2494814"
From MaRDI portal
The following pages link to A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814):
Displayed 9 items.
- Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
- Constraint-based very large-scale neighborhood search (Q434452) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Further extension of the TSP assign neighborhood (Q2491321) (← links)
- A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)