Greedy-type resistance of combinatorial problems

DOI10.1016/j.disopt.2006.03.001zbMath1112.90065OpenAlexW2077940370MaRDI QIDQ865746

Gareth Bendall, Margot, François

Publication date: 20 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.03.001

zbMATH Keywords

greedy algorithmsdomination analysisgreedy resistance

Mathematics Subject Classification ID

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

Related Items (2)

Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems ⋮ A scheduling problem in the baking industry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
• Domination analysis of combinatorial optimization problems.
• TSP heuristics: domination analysis and complexity
• Anti-matroids
• The traveling salesman problem and its variations
• When the greedy algorithm fails
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Greedy-type resistance of combinatorial problems