scientific article
From MaRDI portal
Publication:2867371
zbMath1277.90139MaRDI QIDQ2867371
Daniel Karapetyan, Gregory Gutin
Publication date: 11 December 2013
Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/5660
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items (7)
An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem ⋮ Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations ⋮ A novel discretization scheme for the close enough traveling salesman problem ⋮ New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem ⋮ Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem ⋮ Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm ⋮ A biased random-key genetic algorithm for the set orienteering problem
Uses Software
This page was built for publication:
