Lokālās un globālās optimizācijas algoritmi dažu kombinatoriskās ģeometrijas uzdevumu risināšanā
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Darbā pētīta diskrētās optimizācijas problēma par pentamino arku maksimālajiem laukumiem L(h) un L(l) atkarībā no arkas augstuma h un pamata garuma l. Problēmas risināšanai izstrādāts algoritms, kas balstās uz dinamiskās programmēšanas principu.
Darbā apskatīta barjeru skaita minimizācijas problēma gan pentamino, gan V trimino salikumos.
Atslēgvārdi: pentamino, pentamino arka, polimino, optimizācija, barjeras.
The discrete optimization problem of the maximum area of the pentomino bridges depending on the height h of the bridge or depending on the distance along the base has been investigated in this work. The algorithm based on the principle of the dynamic programming has been elaborated for the problem solution. The discrete optimization problem of minimum number of barriers placed in pentomino or V-tromino tilings has been investigated in this work. Keywords: pentomino, polyomino, bridge of pentominoes, optimization, barriers.
The discrete optimization problem of the maximum area of the pentomino bridges depending on the height h of the bridge or depending on the distance along the base has been investigated in this work. The algorithm based on the principle of the dynamic programming has been elaborated for the problem solution. The discrete optimization problem of minimum number of barriers placed in pentomino or V-tromino tilings has been investigated in this work. Keywords: pentomino, polyomino, bridge of pentominoes, optimization, barriers.