scientific article; zbMATH DE number 2064409
From MaRDI portal
Publication:4461908
zbMath1113.90354MaRDI QIDQ4461908
Alexey Zverovich, Gregory Gutin, Anders Yeo
Publication date: 18 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
Fast Heuristics and Approximation Algorithms ⋮ The Bipartite QUBO ⋮ Integer Programming: Optimization and Evaluation Are Equivalent ⋮ Domination analysis for minimum multiprocessor scheduling ⋮ A new asymmetric pyramidally solvable class of the traveling salesman problem ⋮ Pyramidal tours and multiple objectives ⋮ The parameterized complexity of local search for TSP, more refined ⋮ Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ 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 ⋮ Transformations of generalized ATSP into ATSP. ⋮ An exponential (matching based) neighborhood for the vehicle routing problem ⋮ Domination analysis of combinatorial optimization problems. ⋮ Upper bounds on ATSP neighborhood size. ⋮ Dominance guarantees for above-average solutions ⋮ Parameterized Traveling Salesman Problem: Beating the Average ⋮ Further extension of the TSP assign neighborhood ⋮ A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem ⋮ A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem ⋮ Four-point conditions for the TSP: the complete complexity classification ⋮ A new ILP-based refinement heuristic for vehicle routing problems
This page was built for publication:
