Czech Technical University in

Prague
Faculty of Mechanical
Engineering

Seminar Work
“A visit to Prague”

Operations Research
(AE1M16OVY)
 “A visit to Prague” – Seminar Work Guido Piotrowski

Introduction
During this Seminar Work I will be analyzing Prague city from the point of view of a tourist who has just
arrived in. He will be probably wondering how to organize his journey in order to get the best of such a
diverse city.
As many others, this tourist has decided to dedicate only 1 day in Prague, of his whole trip around Europe.
And moreover, his budget is quite tight.
In numbers, he has

 
 = 1  −  
 −  
 −  
 −  

= 24 ℎ − 8 ℎ − 1 ℎ . 4 − 3 ℎ − 1 ℎ = 8 ℎ
Secondly, he brought 1000  with him, to spend in that day.
The tourist is very confident when using Trip Advisor, a well-known website that gathers tourist review
of places. In it, people can rate, from 1 to 5 stars, how good their experience was.

Figure 1. Trip Advisor - Prague Webpage

He has rarely been disappointed by those reviews, so he decided to visit the places priorily according to
the highest rating, and get the most of the stars in that visit to Prague.

Figure 2. Example of Trip Advisor's rating system for Stare Mesto

Doc. Ing. Jaroslav Knápek CSc. 2

 “A visit to Prague” – Seminar Work Guido Piotrowski

On the other hand, he took into account the prices and time that each attraction he was interested in
implies. He built the following table:

Price Time
ci Name
CZK EUR hs
1 Old Town (Stare Mesto) 274,30 10,00 1,00
2 Castle Tour 960,05 35,00 2,50
3 Karluv Most 0,00 0,00 0,50
4 State Opera 1536,08 56,00 2,00
5 Zegway tour 2000,00 72,91 1,00
6 The Powder Tower 70,00 2,55 0,75
7 KGB Museum 246,87 9,00 2,00
8 Zizkov Television Tower 274,30 10,00 2,00

From Trip Advisor website, he collected all user ratings to build a general result. He determined that each
value represented the specific rate, and that an attraction that lasts longer necessarily represents a bigger
value:

Trip Advisor Values

ci Name
Excelent Very good Average Poor Terrible Result Total Result
1 Old Town (Stare Mesto) 6815 1985 229 31 15 4,71 4,71
2 Castle Tour 4415 1363 266 38 10 4,66 11,66
3 Karluv Most 10147 4047 948 119 47 4,58 2,29
4 State Opera 710 241 41 10 12 4,61 9,21
5 Zegway tour 1410 37 0 0 0 4,98 4,98
6 The Powder Tower 92 158 50 1 0 4,14 3,10
7 KGB Museum 731 259 53 21 40 4,47 8,94
8 Zizkov Television Tower 114 120 62 16 8 3,99 7,98

After deciding which attractions are best to do, the tourist will need to now which is the best way to get
to those; in the optimal time cost.

Part 1: selecting the best attractions

Method proposal
This case introduces a list of 8 items, which need to be determined if to do or not, ir order to maximize a
function restricted by 2 inequations (constrains). This means that the case is a bivalent integer problem (0
and 1). To solve it, I will use the "Branch & Bound method", seen in class.

Branch & Bound Method

Branch and bound is an algorithm design paradigm for discrete and combinatorial
optimization problems, as well asgeneral real valued problems. A branch-and-bound algorithm consists of

Doc. Ing. Jaroslav Knápek CSc. 3

 “A visit to Prague” – Seminar Work Guido Piotrowski

a systematic enumeration of candidate solutions by means of state space search: the set of candidate
solutions is thought of as forming a rooted tree with the full set at the root.
The algorithm explores branches of this tree, which represent subsets of the solution set. Before
enumerating the candidate solutions of a branch, the branch is checked against upper and lower
estimated bounds on the optimal solution, and is discarded if it cannot produce a better solution than the
best one found so far by the algorithm.

Data input

: " = 4,71. %& + 11,66. %) + 2,29. %+ + 9,21. %, + 4,98. %- + 3,1. %. + 8,94. %/ + 7,98. %0
ST:
274,30. %& + 960,05. %) + 0. %+ + 1536,08. %, + 2000. %- + 70. %. + 246,87. %/ + 274,30. %0 ≤ 2000 [5"]
1 1. %& + 2,5. %) + 0,5. %+ + 2. %, + 1. %- + 0,75. %. + 2. %/ + 2. %0 ≤ 8 [ℎ]
%7 ∈ 90; 1;,  = 1, 2, … ,8

Solving the problem

Due to the enormous amount of possible combinations for 8 variables (20 = 256), I decided to solve this
problem using an Excel chart.
On the Output sheet, it is shown all the binary combinations. On each row,
• Firstly, I have calculated the Z value, which has to be maximized.
• Secondly, the total price. On its right column, it is shown if the value is valid according to the
budget.
• Last, the total time required. Again, it’s shown if there is available time to do it.
If the second and third options are valid, the whole combination is possible and its value will be shown
next. Unless, there is an above value which Z is higher than the one calculated.

Results
Looking at the Output sheet, the best result is given for 11100011, which give a " = 35,57956.

Analysis
Reviewing all the possible combinations, it is clear that the Zegway tour (%- ) only increases " in 4,98,
and has used all the budget available. Only by going to the Castle tour (%) ) it is possible to increase " to
11,66, and moreover, we still have some money and time to use.
Similarly, the State Opera makes " = 9,21, and takes 1536,08 CZK. The Castle Tour, Z=11,66, and uses
less money. Ideally, we could use both, but in that case, the cost is 2496,130 5" > 2000 5".
It is now clearer, that the branch is through the Castle tour.
Fortunately, it is free to visit Karluv Most and only takes 30 min of the available time; despite the "
increase is only 2,29. But it helps to maximize the function, for sure.

Doc. Ing. Jaroslav Knápek CSc. 4

 “A visit to Prague” – Seminar Work Guido Piotrowski

Part 2: Selecting the best way to visit the attractions selected

From 8 possible points, we came to the conclusion that only 5 give us the optimal solution for best rating.
Now we need to decide which is the best way to get to those points, according to the map coordinates.

Figure 3. Best walking path according to Google Maps, between Prague's Castle and KGB Museum.

Doc. Ing. Jaroslav Knápek CSc. 5

 “A visit to Prague” – Seminar Work Guido Piotrowski

I located those 5 points in Google Maps, and trace the optimal walking paths between each 2 points. The
results are shown in the following table:
Cost
Edge
(min)
1 2 19
1 3 9
1 7 19
1 8 41
3 2 16
3 7 8
3 8 44
2 7 6
2 8 54
7 8 56

Graphically,

19
1 2

9 19 6
16

41
54

3 7
8

56
44
8

Doc. Ing. Jaroslav Knápek CSc. 6

 “A visit to Prague” – Seminar Work Guido Piotrowski

Method proposal
As all this 5 points have to be match in one single path, I propose the “Minimum Spanning Tree
Method”

Minimum Spanning Tree Method

Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and
connects all the verticestogether. A single graph can have many different spanning trees. We can also assign
a weight to each edge, which is a number representing how unfavorable it is, and use this to assign a weight
to a spanning tree by computing the sum of the weights of the edges in that spanning tree.
It is then a spanning tree with weight less than or equal to the weight of every other spanning tree. More
generally, any undirected graph (not necessarily connected) has a minimum spanning forest, which is a
union of minimum spanning trees for its connected components.

Solving the problem

Looking at the graph (or the table), we can observe that the minimum weight edge is given by 2 − 7
(>ℎ = 6 min). So if we want to connect all nodes optimally it is mandatory that one edge is the one
just mentioned.
Secondly, edge 3 − 7, with >ℎ = 8
, and edge 3 − 1 with 9
, follow in importance.
Now that nodes 2, 7, 3 & 1 are connected; we are only missing node 8. It is clear that we can do it whether
via 2 − 8 or 1 − 8. As the second weight is lower (41
 vs. 54
), we will choose that one.

19
1 2

9 16 19
6

41 54

3 7
8

8 56
44

Doc. Ing. Jaroslav Knápek CSc. 7

 “A visit to Prague” – Seminar Work Guido Piotrowski

Results
According to the graph, our “Minimum Spanning Tree” is connected like this

2 7 3 1 8

Which gives us a C >ℎ = D6 + 8 + 9 + 41E

 = 64
. And this also means that we can
whether start from node 2 or from 8, and finish in 8 and 2, respectively.

Final Conclusion
We have just analyzed a very common situation of a tourist in Prague. All the data input was obtain from
internet (distances, best ratings) and mixed with a truthful money and time restriction.
In other words, this could be a perfectly normal situation, besides reality doesn’t always match the
numbers (delays, getting lost, not having enough available time, etc.).
But, in general terms, we have just proved how a simple Operations Research model can simplify such a
daily person’s problem.
According to Prague City Tourism1,

“The funicular on Petřín Hill carried 1,817,233 passengers in 2013. Prague Castle
welcomed 1,748,000 paying visitors, and more than 6 million visitors passed through
the castle grounds. The number one Prague tower was the Old Town Hall tower,
where 623,539 tourists climbed to the top.”
Millions of tourists visit the city every year, and have to face similar problems to the one analyzed during
this inform. So, a numeric solution (and for e.g. offered on internet, that could calculate the results
automatically) could make their life easier when making a trip decision.

1
Source: http://www.praguecitytourism.cz/en/our-services/statistics-and-analysis-/visitor-statistics-for-prague-
heritage-sites

Doc. Ing. Jaroslav Knápek CSc. 8

 “A visit to Prague” – Seminar Work Guido Piotrowski

Bibliography
• Class notebook.
• Hillier Lieberman – “Introduction to Operations Research”
o Taha – “Operations Research - An introduction”
o TripAdvisor (www.tripadvisor.com)
o http://www.tripadvisor.com/Attraction_Review-g274707-d275451-Reviews-
Old_Town_Stare_Mesto-Prague_Bohemia.html
o http://www.tripadvisor.com/Attraction_Review-g274707-d276185-Reviews-
St_Vitus_Cathedral-Prague_Bohemia.html
o http://www.tripadvisor.com/Attraction_Review-g274707-d275157-Reviews-
Charles_Bridge_Karluv_Most-Prague_Bohemia.html
o http://www.tripadvisor.com/Attraction_Review-g274707-d6782276-Reviews-
Ballooning_CZ-Prague_Bohemia.html
o http://www.tripadvisor.com/Attraction_Review-g274707-d4881452-Reviews-
Zizkov_Televison_Tower-Prague_Bohemia.html
o http://www.tripadvisor.es/Attraction_Review-g274707-d318576-Reviews-
The_Powder_Tower-Prague_Bohemia.html
o http://www.tripadvisor.es/Attraction_Review-g274707-d2665565-Reviews-
KGB_Museum-Prague_Bohemia.html
o http://www.tripadvisor.es/Attraction_Review-g274707-d4881452-Reviews-
Zizkov_Televison_Tower-Prague_Bohemia.html
• http://en.wikipedia.org/wiki/Minimum_spanning_tree
• http://en.wikipedia.org/wiki/Branch_and_bound

Doc. Ing. Jaroslav Knápek CSc. 9

 “A visit to Prague” – Seminar Work Guido Piotrowski

Annex

Total price Total time

Decimal Binary Z= Valid Valid max.
CZK <Budg. hs <Avail. Time
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
1 0 0 0 0 0 0 0 1 7,98125 274,3 274,3 2 2 1 7,98125
2 0 0 0 0 0 0 1 0 8,936594 246,87 246,9 2 2 1 8,936594
3 0 0 0 0 0 0 1 1 16,91784 521,17 521,2 4 4 1 16,91784
4 0 0 0 0 0 1 0 0 3,102159 70 70 0,75 0,75 1 16,91784
5 0 0 0 0 0 1 0 1 11,08341 344,3 344,3 2,75 2,75 1 16,91784
6 0 0 0 0 0 1 1 0 12,03875 316,87 316,9 2,75 2,75 1 16,91784
7 0 0 0 0 0 1 1 1 20,02 591,17 591,2 4,75 4,75 1 20,02
8 0 0 0 0 1 0 0 0 4,975121 2000 2000 1 1 1 20,02
9 0 0 0 0 1 0 0 1 12,95637 2274,3 2274 3 3 0 20,02
10 0 0 0 0 1 0 1 0 13,91172 2246,87 2247 3 3 0 20,02
11 0 0 0 0 1 0 1 1 21,89297 2521,17 2521 5 5 0 20,02
12 0 0 0 0 1 1 0 0 8,07728 2070 2070 1,75 1,75 0 20,02
13 0 0 0 0 1 1 0 1 16,05853 2344,3 2344 3,75 3,75 0 20,02
14 0 0 0 0 1 1 1 0 17,01387 2316,87 2317 3,75 3,75 0 20,02
15 0 0 0 0 1 1 1 1 24,99512 2591,17 2591 5,75 5,75 0 20,02
16 0 0 0 1 0 0 0 0 9,211045 1536,08 1536 2 2 1 20,02
17 0 0 0 1 0 0 0 1 17,1923 1810,38 1810 4 4 1 20,02
18 0 0 0 1 0 0 1 0 18,14764 1782,95 1783 4 4 1 20,02
19 0 0 0 1 0 0 1 1 26,12889 2057,25 2057 6 6 0 20,02
20 0 0 0 1 0 1 0 0 12,3132 1606,08 1606 2,75 2,75 1 20,02
21 0 0 0 1 0 1 0 1 20,29445 1880,38 1880 4,75 4,75 1 20,29445
22 0 0 0 1 0 1 1 0 21,2498 1852,95 1853 4,75 4,75 1 21,2498
23 0 0 0 1 0 1 1 1 29,23105 2127,25 2127 6,75 6,75 0 21,2498
24 0 0 0 1 1 0 0 0 14,18617 3536,08 3536 3 3 0 21,2498
25 0 0 0 1 1 0 0 1 22,16742 3810,38 3810 5 5 0 21,2498
26 0 0 0 1 1 0 1 0 23,12276 3782,95 3783 5 5 0 21,2498
27 0 0 0 1 1 0 1 1 31,10401 4057,25 4057 7 7 0 21,2498
28 0 0 0 1 1 1 0 0 17,28833 3606,08 3606 3,75 3,75 0 21,2498
29 0 0 0 1 1 1 0 1 25,26958 3880,38 3880 5,75 5,75 0 21,2498
30 0 0 0 1 1 1 1 0 26,22492 3852,95 3853 5,75 5,75 0 21,2498
31 0 0 0 1 1 1 1 1 34,20617 4127,25 4127 7,75 7,75 0 21,2498
32 0 0 1 0 0 0 0 0 2,288117 0 0 0,5 0,5 1 21,2498
33 0 0 1 0 0 0 0 1 10,26937 274,3 274,3 2,5 2,5 1 21,2498
34 0 0 1 0 0 0 1 0 11,22471 246,87 246,9 2,5 2,5 1 21,2498
35 0 0 1 0 0 0 1 1 19,20596 521,17 521,2 4,5 4,5 1 21,2498
36 0 0 1 0 0 1 0 0 5,390277 70 70 1,25 1,25 1 21,2498

Doc. Ing. Jaroslav Knápek CSc. 10

 “A visit to Prague” – Seminar Work Guido Piotrowski

37 0 0 1 0 0 1 0 1 13,37153 344,3 344,3 3,25 3,25 1 21,2498

38 0 0 1 0 0 1 1 0 14,32687 316,87 316,9 3,25 3,25 1 21,2498
39 0 0 1 0 0 1 1 1 22,30812 591,17 591,2 5,25 5,25 1 22,30812
40 0 0 1 0 1 0 0 0 7,263238 2000 2000 1,5 1,5 1 22,30812
41 0 0 1 0 1 0 0 1 15,24449 2274,3 2274 3,5 3,5 0 22,30812
42 0 0 1 0 1 0 1 0 16,19983 2246,87 2247 3,5 3,5 0 22,30812
43 0 0 1 0 1 0 1 1 24,18108 2521,17 2521 5,5 5,5 0 22,30812
44 0 0 1 0 1 1 0 0 10,3654 2070 2070 2,25 2,25 0 22,30812
45 0 0 1 0 1 1 0 1 18,34665 2344,3 2344 4,25 4,25 0 22,30812
46 0 0 1 0 1 1 1 0 19,30199 2316,87 2317 4,25 4,25 0 22,30812
47 0 0 1 0 1 1 1 1 27,28324 2591,17 2591 6,25 6,25 0 22,30812
48 0 0 1 1 0 0 0 0 11,49916 1536,08 1536 2,5 2,5 1 22,30812
49 0 0 1 1 0 0 0 1 19,48041 1810,38 1810 4,5 4,5 1 22,30812
50 0 0 1 1 0 0 1 0 20,43576 1782,95 1783 4,5 4,5 1 22,30812
51 0 0 1 1 0 0 1 1 28,41701 2057,25 2057 6,5 6,5 0 22,30812
52 0 0 1 1 0 1 0 0 14,60132 1606,08 1606 3,25 3,25 1 22,30812
53 0 0 1 1 0 1 0 1 22,58257 1880,38 1880 5,25 5,25 1 22,58257
54 0 0 1 1 0 1 1 0 23,53792 1852,95 1853 5,25 5,25 1 23,53792
55 0 0 1 1 0 1 1 1 31,51917 2127,25 2127 7,25 7,25 0 23,53792
56 0 0 1 1 1 0 0 0 16,47428 3536,08 3536 3,5 3,5 0 23,53792
57 0 0 1 1 1 0 0 1 24,45553 3810,38 3810 5,5 5,5 0 23,53792
58 0 0 1 1 1 0 1 0 25,41088 3782,95 3783 5,5 5,5 0 23,53792
59 0 0 1 1 1 0 1 1 33,39213 4057,25 4057 7,5 7,5 0 23,53792
60 0 0 1 1 1 1 0 0 19,57644 3606,08 3606 4,25 4,25 0 23,53792
61 0 0 1 1 1 1 0 1 27,55769 3880,38 3880 6,25 6,25 0 23,53792
62 0 0 1 1 1 1 1 0 28,51304 3852,95 3853 6,25 6,25 0 23,53792
63 0 0 1 1 1 1 1 1 36,49429 4127,25 4127 8,25 8,25 0 23,53792
64 0 1 0 0 0 0 0 0 11,65955 960,05 960,1 2,5 2,5 1 23,53792
65 0 1 0 0 0 0 0 1 19,6408 1234,35 1234 4,5 4,5 1 23,53792
66 0 1 0 0 0 0 1 0 20,59615 1206,92 1207 4,5 4,5 1 23,53792
67 0 1 0 0 0 0 1 1 28,5774 1481,22 1481 6,5 6,5 1 28,5774
68 0 1 0 0 0 1 0 0 14,76171 1030,05 1030 3,25 3,25 1 28,5774
69 0 1 0 0 0 1 0 1 22,74296 1304,35 1304 5,25 5,25 1 28,5774
70 0 1 0 0 0 1 1 0 23,69831 1276,92 1277 5,25 5,25 1 28,5774
71 0 1 0 0 0 1 1 1 31,67956 1551,22 1551 7,25 7,25 1 31,67956
72 0 1 0 0 1 0 0 0 16,63467 2960,05 2960 3,5 3,5 0 31,67956
73 0 1 0 0 1 0 0 1 24,61592 3234,35 3234 5,5 5,5 0 31,67956
74 0 1 0 0 1 0 1 0 25,57127 3206,92 3207 5,5 5,5 0 31,67956
75 0 1 0 0 1 0 1 1 33,55252 3481,22 3481 7,5 7,5 0 31,67956
76 0 1 0 0 1 1 0 0 19,73683 3030,05 3030 4,25 4,25 0 31,67956
77 0 1 0 0 1 1 0 1 27,71808 3304,35 3304 6,25 6,25 0 31,67956
78 0 1 0 0 1 1 1 0 28,67343 3276,92 3277 6,25 6,25 0 31,67956

Doc. Ing. Jaroslav Knápek CSc. 11

 “A visit to Prague” – Seminar Work Guido Piotrowski

79 0 1 0 0 1 1 1 1 36,65468 3551,22 3551 8,25 8,25 0 31,67956

80 0 1 0 1 0 0 0 0 20,8706 2496,13 2496 4,5 4,5 0 31,67956
81 0 1 0 1 0 0 0 1 28,85185 2770,43 2770 6,5 6,5 0 31,67956
82 0 1 0 1 0 0 1 0 29,80719 2743 2743 6,5 6,5 0 31,67956
83 0 1 0 1 0 0 1 1 37,78844 3017,3 3017 8,5 8,5 0 31,67956
84 0 1 0 1 0 1 0 0 23,97276 2566,13 2566 5,25 5,25 0 31,67956
85 0 1 0 1 0 1 0 1 31,95401 2840,43 2840 7,25 7,25 0 31,67956
86 0 1 0 1 0 1 1 0 32,90935 2813 2813 7,25 7,25 0 31,67956
87 0 1 0 1 0 1 1 1 40,8906 3087,3 3087 9,25 9,25 0 31,67956
88 0 1 0 1 1 0 0 0 25,84572 4496,13 4496 5,5 5,5 0 31,67956
89 0 1 0 1 1 0 0 1 33,82697 4770,43 4770 7,5 7,5 0 31,67956
90 0 1 0 1 1 0 1 0 34,78231 4743 4743 7,5 7,5 0 31,67956
91 0 1 0 1 1 0 1 1 42,76356 5017,3 5017 9,5 9,5 0 31,67956
92 0 1 0 1 1 1 0 0 28,94788 4566,13 4566 6,25 6,25 0 31,67956
93 0 1 0 1 1 1 0 1 36,92913 4840,43 4840 8,25 8,25 0 31,67956
94 0 1 0 1 1 1 1 0 37,88447 4813 4813 8,25 8,25 0 31,67956
95 0 1 0 1 1 1 1 1 45,86572 5087,3 5087 10,25 10,25 0 31,67956
96 0 1 1 0 0 0 0 0 13,94767 960,05 960,1 3 3 1 31,67956
97 0 1 1 0 0 0 0 1 21,92892 1234,35 1234 5 5 1 31,67956
98 0 1 1 0 0 0 1 0 22,88427 1206,92 1207 5 5 1 31,67956
99 0 1 1 0 0 0 1 1 30,86552 1481,22 1481 7 7 1 31,67956
100 0 1 1 0 0 1 0 0 17,04983 1030,05 1030 3,75 3,75 1 31,67956
101 0 1 1 0 0 1 0 1 25,03108 1304,35 1304 5,75 5,75 1 31,67956
102 0 1 1 0 0 1 1 0 25,98642 1276,92 1277 5,75 5,75 1 31,67956
103 0 1 1 0 0 1 1 1 33,96767 1551,22 1551 7,75 7,75 1 33,96767
104 0 1 1 0 1 0 0 0 18,92279 2960,05 2960 4 4 0 33,96767
105 0 1 1 0 1 0 0 1 26,90404 3234,35 3234 6 6 0 33,96767
106 0 1 1 0 1 0 1 0 27,85939 3206,92 3207 6 6 0 33,96767
107 0 1 1 0 1 0 1 1 35,84064 3481,22 3481 8 8 0 33,96767
108 0 1 1 0 1 1 0 0 22,02495 3030,05 3030 4,75 4,75 0 33,96767
109 0 1 1 0 1 1 0 1 30,0062 3304,35 3304 6,75 6,75 0 33,96767
110 0 1 1 0 1 1 1 0 30,96155 3276,92 3277 6,75 6,75 0 33,96767
111 0 1 1 0 1 1 1 1 38,9428 3551,22 3551 8,75 8,75 0 33,96767
112 0 1 1 1 0 0 0 0 23,15872 2496,13 2496 5 5 0 33,96767
113 0 1 1 1 0 0 0 1 31,13997 2770,43 2770 7 7 0 33,96767
114 0 1 1 1 0 0 1 0 32,09531 2743 2743 7 7 0 33,96767
115 0 1 1 1 0 0 1 1 40,07656 3017,3 3017 9 9 0 33,96767
116 0 1 1 1 0 1 0 0 26,26088 2566,13 2566 5,75 5,75 0 33,96767
117 0 1 1 1 0 1 0 1 34,24213 2840,43 2840 7,75 7,75 0 33,96767
118 0 1 1 1 0 1 1 0 35,19747 2813 2813 7,75 7,75 0 33,96767
119 0 1 1 1 0 1 1 1 43,17872 3087,3 3087 9,75 9,75 0 33,96767
120 0 1 1 1 1 0 0 0 28,13384 4496,13 4496 6 6 0 33,96767

Doc. Ing. Jaroslav Knápek CSc. 12

 “A visit to Prague” – Seminar Work Guido Piotrowski

121 0 1 1 1 1 0 0 1 36,11509 4770,43 4770 8 8 0 33,96767

122 0 1 1 1 1 0 1 0 37,07043 4743 4743 8 8 0 33,96767
123 0 1 1 1 1 0 1 1 45,05168 5017,3 5017 10 10 0 33,96767
124 0 1 1 1 1 1 0 0 31,236 4566,13 4566 6,75 6,75 0 33,96767
125 0 1 1 1 1 1 0 1 39,21725 4840,43 4840 8,75 8,75 0 33,96767
126 0 1 1 1 1 1 1 0 40,17259 4813 4813 8,75 8,75 0 33,96767
127 0 1 1 1 1 1 1 1 48,15384 5087,3 5087 10,75 10,75 0 33,96767
128 1 0 0 0 0 0 0 0 4,71405 274,3 274,3 1 1 1 33,96767
129 1 0 0 0 0 0 0 1 12,6953 548,6 548,6 3 3 1 33,96767
130 1 0 0 0 0 0 1 0 13,65064 521,17 521,2 3 3 1 33,96767
131 1 0 0 0 0 0 1 1 21,63189 795,47 795,5 5 5 1 33,96767
132 1 0 0 0 0 1 0 0 7,816209 344,3 344,3 1,75 1,75 1 33,96767
133 1 0 0 0 0 1 0 1 15,79746 618,6 618,6 3,75 3,75 1 33,96767
134 1 0 0 0 0 1 1 0 16,7528 591,17 591,2 3,75 3,75 1 33,96767
135 1 0 0 0 0 1 1 1 24,73405 865,47 865,5 5,75 5,75 1 33,96767
136 1 0 0 0 1 0 0 0 9,689171 2274,3 2274 2 2 0 33,96767
137 1 0 0 0 1 0 0 1 17,67042 2548,6 2549 4 4 0 33,96767
138 1 0 0 0 1 0 1 0 18,62576 2521,17 2521 4 4 0 33,96767
139 1 0 0 0 1 0 1 1 26,60701 2795,47 2795 6 6 0 33,96767
140 1 0 0 0 1 1 0 0 12,79133 2344,3 2344 2,75 2,75 0 33,96767
141 1 0 0 0 1 1 0 1 20,77258 2618,6 2619 4,75 4,75 0 33,96767
142 1 0 0 0 1 1 1 0 21,72792 2591,17 2591 4,75 4,75 0 33,96767
143 1 0 0 0 1 1 1 1 29,70917 2865,47 2865 6,75 6,75 0 33,96767
144 1 0 0 1 0 0 0 0 13,92509 1810,38 1810 3 3 1 33,96767
145 1 0 0 1 0 0 0 1 21,90634 2084,68 2085 5 5 0 33,96767
146 1 0 0 1 0 0 1 0 22,86169 2057,25 2057 5 5 0 33,96767
147 1 0 0 1 0 0 1 1 30,84294 2331,55 2332 7 7 0 33,96767
148 1 0 0 1 0 1 0 0 17,02725 1880,38 1880 3,75 3,75 1 33,96767
149 1 0 0 1 0 1 0 1 25,0085 2154,68 2155 5,75 5,75 0 33,96767
150 1 0 0 1 0 1 1 0 25,96385 2127,25 2127 5,75 5,75 0 33,96767
151 1 0 0 1 0 1 1 1 33,9451 2401,55 2402 7,75 7,75 0 33,96767
152 1 0 0 1 1 0 0 0 18,90022 3810,38 3810 4 4 0 33,96767
153 1 0 0 1 1 0 0 1 26,88147 4084,68 4085 6 6 0 33,96767
154 1 0 0 1 1 0 1 0 27,83681 4057,25 4057 6 6 0 33,96767
155 1 0 0 1 1 0 1 1 35,81806 4331,55 4332 8 8 0 33,96767
156 1 0 0 1 1 1 0 0 22,00238 3880,38 3880 4,75 4,75 0 33,96767
157 1 0 0 1 1 1 0 1 29,98363 4154,68 4155 6,75 6,75 0 33,96767
158 1 0 0 1 1 1 1 0 30,93897 4127,25 4127 6,75 6,75 0 33,96767
159 1 0 0 1 1 1 1 1 38,92022 4401,55 4402 8,75 8,75 0 33,96767
160 1 0 1 0 0 0 0 0 7,002167 274,3 274,3 1,5 1,5 1 33,96767
161 1 0 1 0 0 0 0 1 14,98342 548,6 548,6 3,5 3,5 1 33,96767
162 1 0 1 0 0 0 1 0 15,93876 521,17 521,2 3,5 3,5 1 33,96767

Doc. Ing. Jaroslav Knápek CSc. 13

 “A visit to Prague” – Seminar Work Guido Piotrowski

163 1 0 1 0 0 0 1 1 23,92001 795,47 795,5 5,5 5,5 1 33,96767

164 1 0 1 0 0 1 0 0 10,10433 344,3 344,3 2,25 2,25 1 33,96767
165 1 0 1 0 0 1 0 1 18,08558 618,6 618,6 4,25 4,25 1 33,96767
166 1 0 1 0 0 1 1 0 19,04092 591,17 591,2 4,25 4,25 1 33,96767
167 1 0 1 0 0 1 1 1 27,02217 865,47 865,5 6,25 6,25 1 33,96767
168 1 0 1 0 1 0 0 0 11,97729 2274,3 2274 2,5 2,5 0 33,96767
169 1 0 1 0 1 0 0 1 19,95854 2548,6 2549 4,5 4,5 0 33,96767
170 1 0 1 0 1 0 1 0 20,91388 2521,17 2521 4,5 4,5 0 33,96767
171 1 0 1 0 1 0 1 1 28,89513 2795,47 2795 6,5 6,5 0 33,96767
172 1 0 1 0 1 1 0 0 15,07945 2344,3 2344 3,25 3,25 0 33,96767
173 1 0 1 0 1 1 0 1 23,0607 2618,6 2619 5,25 5,25 0 33,96767
174 1 0 1 0 1 1 1 0 24,01604 2591,17 2591 5,25 5,25 0 33,96767
175 1 0 1 0 1 1 1 1 31,99729 2865,47 2865 7,25 7,25 0 33,96767
176 1 0 1 1 0 0 0 0 16,21321 1810,38 1810 3,5 3,5 1 33,96767
177 1 0 1 1 0 0 0 1 24,19446 2084,68 2085 5,5 5,5 0 33,96767
178 1 0 1 1 0 0 1 0 25,14981 2057,25 2057 5,5 5,5 0 33,96767
179 1 0 1 1 0 0 1 1 33,13106 2331,55 2332 7,5 7,5 0 33,96767
180 1 0 1 1 0 1 0 0 19,31537 1880,38 1880 4,25 4,25 1 33,96767
181 1 0 1 1 0 1 0 1 27,29662 2154,68 2155 6,25 6,25 0 33,96767
182 1 0 1 1 0 1 1 0 28,25197 2127,25 2127 6,25 6,25 0 33,96767
183 1 0 1 1 0 1 1 1 36,23322 2401,55 2402 8,25 8,25 0 33,96767
184 1 0 1 1 1 0 0 0 21,18833 3810,38 3810 4,5 4,5 0 33,96767
185 1 0 1 1 1 0 0 1 29,16958 4084,68 4085 6,5 6,5 0 33,96767
186 1 0 1 1 1 0 1 0 30,12493 4057,25 4057 6,5 6,5 0 33,96767
187 1 0 1 1 1 0 1 1 38,10618 4331,55 4332 8,5 8,5 0 33,96767
188 1 0 1 1 1 1 0 0 24,29049 3880,38 3880 5,25 5,25 0 33,96767
189 1 0 1 1 1 1 0 1 32,27174 4154,68 4155 7,25 7,25 0 33,96767
190 1 0 1 1 1 1 1 0 33,22709 4127,25 4127 7,25 7,25 0 33,96767
191 1 0 1 1 1 1 1 1 41,20834 4401,55 4402 9,25 9,25 0 33,96767
192 1 1 0 0 0 0 0 0 16,3736 1234,35 1234 3,5 3,5 1 33,96767
193 1 1 0 0 0 0 0 1 24,35485 1508,65 1509 5,5 5,5 1 33,96767
194 1 1 0 0 0 0 1 0 25,3102 1481,22 1481 5,5 5,5 1 33,96767
195 1 1 0 0 0 0 1 1 33,29145 1755,52 1756 7,5 7,5 1 33,96767
196 1 1 0 0 0 1 0 0 19,47576 1304,35 1304 4,25 4,25 1 33,96767
197 1 1 0 0 0 1 0 1 27,45701 1578,65 1579 6,25 6,25 1 33,96767
198 1 1 0 0 0 1 1 0 28,41236 1551,22 1551 6,25 6,25 1 33,96767
199 1 1 0 0 0 1 1 1 36,39361 1825,52 1826 8,25 8,25 0 33,96767
200 1 1 0 0 1 0 0 0 21,34872 3234,35 3234 4,5 4,5 0 33,96767
201 1 1 0 0 1 0 0 1 29,32997 3508,65 3509 6,5 6,5 0 33,96767
202 1 1 0 0 1 0 1 0 30,28532 3481,22 3481 6,5 6,5 0 33,96767
203 1 1 0 0 1 0 1 1 38,26657 3755,52 3756 8,5 8,5 0 33,96767
204 1 1 0 0 1 1 0 0 24,45088 3304,35 3304 5,25 5,25 0 33,96767

Doc. Ing. Jaroslav Knápek CSc. 14

 “A visit to Prague” – Seminar Work Guido Piotrowski

205 1 1 0 0 1 1 0 1 32,43213 3578,65 3579 7,25 7,25 0 33,96767

206 1 1 0 0 1 1 1 0 33,38748 3551,22 3551 7,25 7,25 0 33,96767
207 1 1 0 0 1 1 1 1 41,36873 3825,52 3826 9,25 9,25 0 33,96767
208 1 1 0 1 0 0 0 0 25,58465 2770,43 2770 5,5 5,5 0 33,96767
209 1 1 0 1 0 0 0 1 33,5659 3044,73 3045 7,5 7,5 0 33,96767
210 1 1 0 1 0 0 1 0 34,52124 3017,3 3017 7,5 7,5 0 33,96767
211 1 1 0 1 0 0 1 1 42,50249 3291,6 3292 9,5 9,5 0 33,96767
212 1 1 0 1 0 1 0 0 28,68681 2840,43 2840 6,25 6,25 0 33,96767
213 1 1 0 1 0 1 0 1 36,66806 3114,73 3115 8,25 8,25 0 33,96767
214 1 1 0 1 0 1 1 0 37,6234 3087,3 3087 8,25 8,25 0 33,96767
215 1 1 0 1 0 1 1 1 45,60465 3361,6 3362 10,25 10,25 0 33,96767
216 1 1 0 1 1 0 0 0 30,55977 4770,43 4770 6,5 6,5 0 33,96767
217 1 1 0 1 1 0 0 1 38,54102 5044,73 5045 8,5 8,5 0 33,96767
218 1 1 0 1 1 0 1 0 39,49636 5017,3 5017 8,5 8,5 0 33,96767
219 1 1 0 1 1 0 1 1 47,47761 5291,6 5292 10,5 10,5 0 33,96767
220 1 1 0 1 1 1 0 0 33,66193 4840,43 4840 7,25 7,25 0 33,96767
221 1 1 0 1 1 1 0 1 41,64318 5114,73 5115 9,25 9,25 0 33,96767
222 1 1 0 1 1 1 1 0 42,59852 5087,3 5087 9,25 9,25 0 33,96767
223 1 1 0 1 1 1 1 1 50,57977 5361,6 5362 11,25 11,25 0 33,96767
224 1 1 1 0 0 0 0 0 18,66172 1234,35 1234 4 4 1 33,96767
225 1 1 1 0 0 0 0 1 26,64297 1508,65 1509 6 6 1 33,96767
226 1 1 1 0 0 0 1 0 27,59831 1481,22 1481 6 6 1 33,96767
227 1 1 1 0 0 0 1 1 35,57956 1755,52 1756 8 8 1 35,57956
228 1 1 1 0 0 1 0 0 21,76388 1304,35 1304 4,75 4,75 1 35,57956
229 1 1 1 0 0 1 0 1 29,74513 1578,65 1579 6,75 6,75 1 35,57956
230 1 1 1 0 0 1 1 0 30,70047 1551,22 1551 6,75 6,75 1 35,57956
231 1 1 1 0 0 1 1 1 38,68172 1825,52 1826 8,75 8,75 0 35,57956
232 1 1 1 0 1 0 0 0 23,63684 3234,35 3234 5 5 0 35,57956
233 1 1 1 0 1 0 0 1 31,61809 3508,65 3509 7 7 0 35,57956
234 1 1 1 0 1 0 1 0 32,57344 3481,22 3481 7 7 0 35,57956
235 1 1 1 0 1 0 1 1 40,55469 3755,52 3756 9 9 0 35,57956
236 1 1 1 0 1 1 0 0 26,739 3304,35 3304 5,75 5,75 0 35,57956
237 1 1 1 0 1 1 0 1 34,72025 3578,65 3579 7,75 7,75 0 35,57956
238 1 1 1 0 1 1 1 0 35,6756 3551,22 3551 7,75 7,75 0 35,57956
239 1 1 1 0 1 1 1 1 43,65685 3825,52 3826 9,75 9,75 0 35,57956
240 1 1 1 1 0 0 0 0 27,87277 2770,43 2770 6 6 0 35,57956
241 1 1 1 1 0 0 0 1 35,85402 3044,73 3045 8 8 0 35,57956
242 1 1 1 1 0 0 1 0 36,80936 3017,3 3017 8 8 0 35,57956
243 1 1 1 1 0 0 1 1 44,79061 3291,6 3292 10 10 0 35,57956
244 1 1 1 1 0 1 0 0 30,97493 2840,43 2840 6,75 6,75 0 35,57956
245 1 1 1 1 0 1 0 1 38,95618 3114,73 3115 8,75 8,75 0 35,57956
246 1 1 1 1 0 1 1 0 39,91152 3087,3 3087 8,75 8,75 0 35,57956

Doc. Ing. Jaroslav Knápek CSc. 15

 “A visit to Prague” – Seminar Work Guido Piotrowski

247 1 1 1 1 0 1 1 1 47,89277 3361,6 3362 10,75 10,75 0 35,57956

248 1 1 1 1 1 0 0 0 32,84789 4770,43 4770 7 7 0 35,57956
249 1 1 1 1 1 0 0 1 40,82914 5044,73 5045 9 9 0 35,57956
250 1 1 1 1 1 0 1 0 41,78448 5017,3 5017 9 9 0 35,57956
251 1 1 1 1 1 0 1 1 49,76573 5291,6 5292 11 11 0 35,57956
252 1 1 1 1 1 1 0 0 35,95005 4840,43 4840 7,75 7,75 0 35,57956
253 1 1 1 1 1 1 0 1 43,9313 5114,73 5115 9,75 9,75 0 35,57956
254 1 1 1 1 1 1 1 0 44,88664 5087,3 5087 9,75 9,75 0 35,57956
255 1 1 1 1 1 1 1 1 52,86789 5361,6 5362 11,75 11,75 0 35,57956

Doc. Ing. Jaroslav Knápek CSc. 16