Exponential irreducible neighborhoods for combinatorial optimization problems

DOI10.1007/s001860200198zbMath1023.90052OpenAlexW2038896115MaRDI QIDQ1396916

Bianca Spille, Robert T. Firla, Robert Weismantel

Publication date: 14 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860200198

zbMATH Keywords

traveling salesman problemsequential ordering problemexponential neighborhoodsalternating paths and cyclesirreducible augmentation vectors

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

A new ILP-based refinement heuristic for vehicle routing problems

Uses Software

• TSPLIB

This page was built for publication: Exponential irreducible neighborhoods for combinatorial optimization problems