Absolute Minimum Weight Structures by Dynamic Programming

1973 ◽  
Vol 99 (11) ◽  
pp. 2339-2344
Author(s):  
Lawrence A. Twisdale ◽  
Narbey Khachaturian
Keyword(s):  
Dynamic Programming ◽  
Minimum Weight ◽  
Absolute Minimum ◽  
Minimum Weight Structures ◽  
Weight Structures

DYNAMIC PROGRAMMING ON INTERVALS

1993 ◽  
Vol 03 (03) ◽  
pp. 323-330 ◽  
Author(s):  
TAKAO ASANO
Keyword(s):  
Dynamic Programming ◽  
Dominating Set ◽  
Minimum Weight ◽  
Time Algorithm ◽  
Interval Graph ◽  
Efficient Implementation ◽  
Maximum Weight ◽  
Circular Arc ◽  
Maximum Weight Clique

We consider problems on intervals which can be solved by dynamic programming. Specifically, we give an efficient implementation of dynamic programming on intervals. As an application, an optimal sequential partition of a graph G=(V, E) can be obtained in O(m log n) time, where n=|V| and m=|E|. We also present an O(n log n) time algorithm for finding a minimum weight dominating set of an interval graph G=(V, E), and an O(m log n) time algorithm for finding a maximum weight clique of a circular-arc graph G=(V, E), provided their intersection models of n intervals (arcs) are given.

scholarly journals The problem solution of the uniform distribution of resources by the dynamic programming method

2016 ◽  
Vol 6 (3) ◽  
pp. 248-254
Author(s):  
Коновальчук ◽  
Evgeniy Konovalchuk ◽  
Коновалов ◽  
Oleg Konovalov ◽  
Сербулов ◽  
...  
Keyword(s):  
Dynamic Programming ◽  
Quadratic Programming ◽  
Utility Function ◽  
Uniform Distribution ◽  
Fixed Number ◽  
Dynamic Programming Method ◽  
Problem Solution ◽  
Absolute Minimum ◽  
Integer Quadratic Programming ◽  
Distribution Of Resources

The solution of two problems is considered for this purpose in the article: the achievements of a conditional minimum and the achievement of an absolute minimum according to the devel-oped algorithms. At the same time the problem solution of achieving the conditional minimum is reduced to theproblem of integer quadratic programming and the problem of achieving the abso-lute minimum – to minimization of the utility function in the field of the set restrictions and to the search of the fixed number of variables.

Sign in / Sign up

Export Citation Format

Share Document