scientific article; zbMATH DE number 2064409

Cited in

(23)

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

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)