Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP

DOI10.1287/MNSC.43.7.908zbMath0890.90172OpenAlexW2014540198MaRDI QIDQ4356654

Fred Glover, Buyang Cao

Publication date: 22 June 1998

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.43.7.908

zbMATH Keywords

tabu searchtraveling salesmanheuristicejection chain

Mathematics Subject Classification ID

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

Related Items (5)

Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches ⋮ A \(k\)-level data structure for large-scale traveling salesman problems ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ The cardinality constrained covering traveling salesman problem

This page was built for publication: Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP