Anti-matroids

DOI10.1016/S0167-6377(02)00117-7zbMath1030.90107OpenAlexW2912076870MaRDI QIDQ1612010

Gregory Gutin, Anders Yeo

Publication date: 28 August 2002

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00117-7

zbMATH Keywords

combinatorial optimizationgreedy algorithmtraveling Salesman problemanti-matroids

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (3)

When the greedy algorithm fails ⋮ Domination analysis for minimum multiprocessor scheduling ⋮ Greedy-type resistance of combinatorial problems

Cites Work

• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
• TSP heuristics: domination analysis and complexity
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
• Domination analysis of some heuristics for the traveling salesman problem
• TSP tour domination and Hamilton cycle decompositions of regular digraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Anti-matroids