scientific article; zbMATH DE number 2064409

Cited in

(23)

Travelling salesman paths on Demidenko matrices
A comprehensive survey on the generalized traveling salesman problem
An exponential (matching based) neighborhood for the vehicle routing problem
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
Further extension of the TSP assign neighborhood
Upper bounds on ATSP neighborhood size.
Pyramidal tours and multiple objectives
The bipartite QUBO
Parameterized traveling salesman problem: beating the average
New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
Fast heuristics and approximation algorithms
A new asymmetric pyramidally solvable class of the traveling salesman problem
Transformations of generalized ATSP into ATSP.
A new ILP-based refinement heuristic for vehicle routing problems
Large multiple neighborhood search for the soft-clustered vehicle-routing problem
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
Domination analysis for minimum multiprocessor scheduling
Dominance guarantees for above-average solutions
Integer Programming: Optimization and Evaluation Are Equivalent
Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures
Domination analysis of combinatorial optimization problems.
The parameterized complexity of local search for TSP, more refined
Four-point conditions for the TSP: the complete complexity classification

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4461908)