Finding the maximum multi improvement on neighborhood exploration

DOI10.1007/s11590-020-01556-5zbMath1483.90182OpenAlexW3007861204MaRDI QIDQ2070118

Vitor N. Coelho, Igor M. Coelho, Janio Carlos Nascimento Silva, Luiz Satoru Ochi, Uéverton S. Souza

Publication date: 21 January 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01556-5

zbMATH Keywords

dynamic programmingtraveling salesman problemmaximum weight clique problemmulti improvementneighborhood exploration

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Uses Software

• TSPLIB
• BHOSLIB
• DIMACS
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variable neighborhood search
• Parallel local search for Steiner trees in graphs
• First vs. best improvement: an empirical study
• The minimum latency problem
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
• TSPLIB—A Traveling Salesman Problem Library
• The Traveling-Salesman Problem

This page was built for publication: Finding the maximum multi improvement on neighborhood exploration