1972
DOI: 10.1108/eb059970
|View full text |Cite
|
Sign up to set email alerts
|

A dynamic programming—integer programming algorithm for allocating touristic investments

Abstract: In a companion paper (1) a general mathematical model for the allocation of touristic investments was developed. In this paper a solution methodology for the model is developed based on the principles of dynamic programming. At each stage of the dynamic program an integer program is solved to limit the range of values of the state variable which must explicitly be considered. The algorithm is illustrated through an example, and the advantages of the solution procedure are explained by considering the solution … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1981
1981
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…Q * (k−1) makes up the first k steps of Q * (k) . This is a special case of the Principle of Optimality [60]: if Q * (k) is optimal, then all subpaths within Q * (k) must be optimal too. In other words, given the optimal…”
Section: Viterbi Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Q * (k−1) makes up the first k steps of Q * (k) . This is a special case of the Principle of Optimality [60]: if Q * (k) is optimal, then all subpaths within Q * (k) must be optimal too. In other words, given the optimal…”
Section: Viterbi Algorithmmentioning
confidence: 99%
“…The search space and prior are the same as those in Section V A. In this stage 23 extra injections are successfully detected: 2,5,11,14,17,19,23,26,29,36,44,47,51,60,61,67,68,76,79,83,85, 95, and 98.…”
Section: B T Obs = 1 Yr Two Interferometersmentioning
confidence: 99%
“…The principle of optimality [74] demonstrates that in our special case, all subpaths Q * (k) made up of the first k steps in Q * (O) are optimal for 1 ≤ k ≤ N T . In that sense, the classic Viterbi algorithm [43] provides a recursive, computationally efficient solution to computing Q * (O) in a HMM, reducing the number of operations from N N T +1 Q to (N T + 1)N Q ln N Q by binary maximization [42].…”
Section: Appendix A: Viterbi Algorithmmentioning
confidence: 83%
“…One difficulty of analyzing high-dimensional data is the so-called "curse of dimensionality" (Bellman, 1957), which describes how, as the number of dimensions increases, the difference in distances between different pairs of points in the sample get smaller, and distance functions become less useful in distinguishing between points. A rule of thumb when trying to detect clusters in dimensions is that a sample size on the order of ~ 2 is required (Formann, 1984).…”
Section: Attitudinal Factorsmentioning
confidence: 99%