scientific article; zbMATH DE number 4019111

MaRDI QIDQ3030863zbMATH OpenFDO

Authors T. A. Jenkyns

Publication date 1986

zbMATH Keywords

algorithmcombinatorial optimization problemsgreedy heuristicmatrices

Mathematics Subject Classification ID

Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• When the greedy algorithm fails
• Intractability and analysis of heuristics for discrete optimization. II
• The approximation ratio of the greedy algorithm for the metric traveling salesman problem
• On the Greedy Solution of Ordering Problems
• scientific article; zbMATH DE number 3970528

Cited in

(7)

• Intractability and analysis of heuristics for discrete optimization. II
• Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
• Greedy algorithm for local heating problem
• When the greedy algorithm fails
• Interpolating greedy and reluctant algorithms
• The greedy algorithm for the symmetric TSP
• Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030863)