The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming, and Branch-and-Bound

1988 ◽  
pp. 1-27 ◽  
Author(s):  
Vipin Kumar ◽  
Laveen N. Kanal
Keyword(s):  
Dynamic Programming ◽  
Branch And Bound ◽  
Heuristic Search

scholarly journals Research on Optimization Algorithm Design Techniques

2019 ◽  
Vol 8 (6S3) ◽  
pp. 1991-1992
Keyword(s):  
Dynamic Programming ◽  
State Space ◽  
Branch And Bound ◽  
Optimization Algorithm ◽  
Feasible Solution ◽  
Algorithm Design ◽  
Optimization Techniques ◽  
Greedy Method ◽  
Design Techniques

This paper discusses various optimization algorithm design techniques. So, optimization techniques which are discussed in this paper are greedy method, dynamic programming and branch and bound. Problem comes under optimization are used to find either maximum or minimum. All these techniques we have multiple inputs and some constraints and we have to find feasible solution using these inputs and constraints. In greedy method we follow some predefined method. Using that predefined method, we reach to the solution. On contrary to this in dynamic programming we take decision at every step and in the end we reach to the solution. In branch and bound we create state space tree and explore all possibilities of live node. Based on some constraint we start killing some alive nodes. Here, firstly I will discuss all the design techniques. Then types of problems that can be solved under each design techniques and their time complexities.

scholarly journals AUG-Segmenter: a user-friendly tool for segmentation of long time series

2010 ◽  
Vol 12 (3) ◽  
pp. 318-328 ◽  
Author(s):  
Abdullah Gedikli ◽  
Hafzullah Aksoy ◽  
N. Erdem Unal
Keyword(s):  
Time Series ◽  
Dynamic Programming ◽  
Linear Regression ◽  
Computer Program ◽  
Branch And Bound ◽  
Real World ◽  
The Third ◽  
Time Series Segmentation ◽  
Long Time ◽  
User Friendly

In this study, three algorithms are presented for time series segmentation. The first algorithm is based on the branch-and-bound approach, the second on the dynamic programming while the third is a modified version of the latter into which the remaining cost concept of the former is introduced. A user-friendly computer program called AUG-Segmenter is developed. Segmentation-by-constant and segmentation-by-linear-regression can be performed by the program. The program is tested on real-world time series of thousands of terms and found useful in performing segmentation satisfactorily and fast.

Sign in / Sign up

Export Citation Format

Share Document