From Dynamic Programming to Greedy Algorithms
نویسندگان
چکیده
A calculus of relations is used to reason about speciications and algorithms for optimi-sation problems. It is shown how certain greedy algorithms can be seen as reenements of dynamic programming. Throughout, the maximum lateness problem is used as a motivating example.
منابع مشابه
Control and Cybernetics Canonical Greedy Algorithms and Dynamic Programming
There has been little work on how to construct greedy algorithms to solve new optimization problems efficiently. Instead, greedy algorithms have generally been designed on an ad hoc basis. On the other hand, dynamic programming has a long history of being a useful tool for solving optimization problems, but is often inefficient. We show how dynamic programming can be used to derive efficient gr...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملOptimization II: Dynamic Programming
In the last chapter, we saw that greedy algorithms are efficient solutions to certain optimization problems. However, there are optimization problems for which no greedy algorithm exists. In this chapter, we will examine a more general technique, known as dynamic programming, for solving optimization problems. Dynamic programming is a technique of implementing a top-down solution using bottom-u...
متن کاملFramework for Design of Dynamic Programming Algorithms
Dynamic programming algorithms for combinatorial optimization generalize the strategy we studied for design and analysis of greedy algorithms. To build a proof of optimality, we first expand the proof structure for greedy algorithms to accommodate multiple first choices and multiple subproblems. We then reduce the high-level algorithm description to a standard recurrence form and find an effici...
متن کاملDecision Tree Construction using Greedy Algorithms and Dynamic Programming – Comparative Study
The paper presents comparative study for different heuristics used by greedy algorithms for constructing of decision trees. We consider the problem of exact learning for decision tables with discrete attributes. We made experiments with randomly generated decision tables contain attributes with three categories {0,1,2}. Complexity of decision trees is estimated relative to several cost function...
متن کامل