Improving Greedy Algorithms by Lookahead-Search

DOI10.1006/JAGM.1994.1001MaRDI QIDQ4289838zbMATH OpenOpenAlexFDO

Authors U. K. Sarkar, Sujoy Ghose, P. P. Chakrabarti, S. De Sarkar

Publication date 28 April 1994

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1994.1001

zbMATH Keywords

0/1 knapsackbin packingcombinatorial optimizationgreedy approximationlookahead searchscheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• A Greedy Look-ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows
• Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
• A class of generalized greedy algorithms for the multi-knapsack problem
• On the Greedy Solution of Ordering Problems

Cited in

(7)

• Moving towards efficient decision tree construction
• Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
• On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem
• Widening: using parallel resources to improve model quality
• On uniqueness of solution to the multi-peg towers of hanoi
• Improving Saddleback Search: A Lesson in Algorithm Design
• On look-ahead and pathology in decision tree learning

This page was built for publication: Improving Greedy Algorithms by Lookahead-Search

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