Introduction To Management Science 10th Edition Taylor Test Bank
Introduction To Management Science 10th Edition Taylor Test Bank
com
https://testbankdeal.com/product/introduction-to-management-
science-10th-edition-taylor-test-bank/
OR CLICK HERE
DOWNLOAD NOW
https://testbankdeal.com/product/introduction-to-management-
science-12th-edition-taylor-test-bank/
https://testbankdeal.com/product/introduction-to-management-
science-11th-edition-taylor-test-bank/
https://testbankdeal.com/product/introduction-to-management-
science-11th-edition-taylor-solutions-manual/
https://testbankdeal.com/product/introduction-to-management-
science-12th-edition-taylor-solutions-manual/
Introduction to Management Science 13th Edition
Anderson Test Bank
https://testbankdeal.com/product/introduction-to-management-
science-13th-edition-anderson-test-bank/
https://testbankdeal.com/product/introduction-to-management-
science-quantitative-13th-edition-anderson-test-bank/
https://testbankdeal.com/product/introduction-to-management-
science-quantitative-approach-15th-edition-anderson-test-bank/
https://testbankdeal.com/product/introduction-to-management-
science-13th-edition-anderson-solutions-manual/
https://testbankdeal.com/product/introduction-to-management-
science-quantitative-approaches-to-decision-making-14th-edition-
anderson-test-bank/
Introduction to Management Science, 10e (Taylor)
Chapter 7 Network Flow Models
1) A network is an arrangement of paths connected at various points through which items move.
Answer: TRUE
Diff: 1 Page Ref: 281
Main Heading: Network Components
Key words: network flow models
2) Networks are popular because they provide a picture of a system and because a large number
of systems can be easily modeled as networks.
Answer: TRUE
Diff: 1 Page Ref: 281
Main Heading: Network Components
Key words: network flow models
4) Branches connect nodes and show flow from one point to another.
Answer: TRUE
Diff: 1 Page Ref: 281
Main Heading: Network Components
Key words: network flow models, branches
1
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
7) The shortest route problem is to find the shortest distance between an origin and various
destination points.
Answer: TRUE
Diff: 1 Page Ref: 282
Main Heading: The Shortest Route Problem
Key words: shortest route problem
8) The shipping company manager wants to determine the best routes for the trucks to take to
reach their destinations. This problem can be solved using the minimal spanning tree.
Answer: FALSE
Diff: 1 Page Ref: 282
Main Heading: The Shortest Route Problem
Key words: shortest route problem
9) The shortest route network problem could help identify the best route for pizza delivery
drivers from the pizza parlor to a specific customer.
Answer: TRUE
Diff: 2 Page Ref: 282
Main Heading: The Shortest Route Problem
Key words: network flow models, shortest route
10) The minimal spanning tree problem is to connect all nodes in a network so that the total
branch lengths are minimized.
Answer: TRUE
Diff: 1 Page Ref: 289
Main Heading: The Minimal Spanning Tree Problem
Key words: minimal spanning tree problem
11) The first step of the minimal spanning tree solution to compute the distance of any path
through the network.
Answer: FALSE
Diff: 2 Page Ref: 291-293
Main Heading: The Minimal Spanning Tree Problem
Key words: minimal spanning tree problem
12) The last step of the minimal spanning tree solution method is to make sure all nodes have
joined the spanning tree.
Answer: TRUE
Diff: 2 Page Ref: 291-293
Main Heading: The Minimal Spanning Tree Problem
Key words: minimal spanning tree problem
2
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
13) In a minimal spanning tree, the source and destination nodes must be connected along a
single path.
Answer: FALSE
Diff: 1 Page Ref: 291-293
Main Heading: The Minimal Spanning Tree Problem
Key words: minimal spanning tree problem
14) The choice of the initial node in the minimal spanning tree technique must be the first node.
Answer: FALSE
Diff: 1 Page Ref: 291-293
Main Heading: The Minimal Spanning Tree Problem
Key words: minimal spanning tree problem
15) The minimal spanning tree allows the visitation of each node without backtracking.
Answer: FALSE
Diff: 2 Page Ref: 291-293
Main Heading: The Minimal Spanning Tree Problem
Key words: minimal spanning tree problem
16) The shortest route network problem could help identify the best plan for running cables for
televisions throughout a building.
Answer: FALSE
Diff: 2 Page Ref: 282
Main Heading: The Minimal Spanning Tree Problem
Key words: network flow models, shortest route, minimal spanning tree
17) The goal of the maximal flow problem is to maximize the amount of flow of items from an
origin to a destination.
Answer: TRUE
Diff: 1 Page Ref: 294
Main Heading: The Maximal Flow Problem
Key words: maximal flow problem
19) To determine the maximum possible flow of railroad cars through the rail system they should
first select the longest path from origin to destination and ship as much as possible on that path.
Answer: FALSE
Diff: 1 Page Ref: 294
Main Heading: The Maximal Flow Problem
Key words: maximal flow problem
3
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
20) The shortest route problem requires that there be a branch from each destination to every
other destination.
Answer: FALSE
Diff: 1 Page Ref: 282
Main Heading: The Maximal Flow Problem
Key words: maximal flow problem
21) The maximal flow algorithm may end with capacity remaining at the source.
Answer: FALSE
Diff: 2 Page Ref: 294-297
Main Heading: The Maximal Flow Problem
Key words: maximal flow problem
22) The source node is the input node in a maximal flow problem.
Answer: TRUE
Diff: 1 Page Ref: 294-297
Main Heading: The Maximal Flow Problem
Key words: maximal flow problem
23) The direction of the flow is not critical in the maximal flow problem.
Answer: FALSE
Diff: 1 Page Ref: 294-297
Main Heading: The Maximal Flow Problem
Key words: maximal flow problem
24) A traffic system could be represented as a network in order to determine bottlenecks using
the maximal flow network algorithm.
Answer: TRUE
Diff: 1 Page Ref: 294
Main Heading: The Maximal Flow Problem
Key words: network flow models, maximal flow
25) In a network flow problem, __________ represent junction points connecting branches.
Answer: nodes
Diff: 1 Page Ref: 281
Main Heading: Network Models
Key words: network flow models, nodes
26) In a network flow problem, __________ connect nodes and show flow from one point to
another.
Answer: branches
Diff: 1 Page Ref: 281
Main Heading: Network Models
Key words: network flow models, branches
4
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
27) In a network flow problem, the values assigned to __________ typically represent distance,
time, or cost.
Answer: branches
Diff: 1 Page Ref: 281
Main Heading: Network Models
Key words: network flow models, branches
28) The shipping company manager wants to determine the best routes for the trucks to take to
reach their destinations. This problem can be solved using the __________ solution technique.
Answer: shortest route
Diff: 1 Page Ref: 282
Main Heading: Network Models
Key words: shortest route problem
29) The __________ connects all nodes in a network so that the total branch lengths are
minimized.
Answer: minimal spanning tree
Diff: 1 Page Ref: 289
Main Heading: Minimal Spanning Tree Problem
Key words: minimal spanning tree problem
30) The goal of the __________ problem is to maximize the amount of flow of items from an
origin to a destination.
Answer: maximal flow
Diff: 1 Page Ref: 294
Main Heading: Maximal Flow Problem
Key words: maximal flow problem
31) A __________ network model could be used to represent the capacity of a series of dams for
flood control.
Answer: maximal flow
Diff: 2 Page Ref: 294
Main Heading: Maximal Flow Problem
Key words: network flow models, maximal flow
32) A company plans to use an automatic guided vehicle for delivering mail to ten departments.
The vehicle will begin from its docking area, visit each department, and return to the docking
area. Cost is proportional to distance traveled. The type of network model that best represent this
situation is __________.
Answer: Shortest route
Diff: 2 Page Ref: 282
Main Heading: Shortest Route Problem
Key words: network flow models, shortest route
5
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
33) Determining where to build roads at the least cost within a park that reaches every popular
sights represents a __________ network model.
Answer: minimal spanning tree
Diff: 1 Page Ref: 289
Main Heading: Minimal Spanning Tree Problem
Key words: network flow models, minimal spanning tree
34) Determining where to build one way roads at the least cost within a park that takes visitors to
every popular sight and returns them to the entrance represents a __________ network model.
Answer: Shortest route
Diff: 2 Page Ref: 282
Main Heading: Shortest Route Problem
Key words: network flow models, shortest route
35) Determining where capacity needs to be added within a series of one way roads within a park
represents a __________ model.
Answer: maximal flow
Diff: 2 Page Ref: 294
Main Heading: Maximal Flow Problem
Key words: network flow models, maximal flow
6
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
Figure 1. Delivery Routes
36) Consider the network diagram given in Figure 1. Assume that the amount on each branch is
the distance in miles between the respective nodes. What is the shortest route from the source
node (node 1) to nodes 2, 3, and 4. Indicate the total distance for each route.
Answer: (node 1) - (node 2): 6 miles
(node 1) - (node 2) - (node 3): 8 miles
(node 1) - (node 2) - (node 4): 11 miles
Diff: 2 Page Ref: 283-286
Main Heading: Shortest Route Problem
Key words: shortest route problem, shortest route problem solution
37) Consider the network diagram given in Figure 1. Assume that the amount on each branch is
the distance in miles between the respective nodes. What is the shortest route from the source
node (node 1) to nodes 5 and 6. Indicate the total distance for each route.
Answer: (node 1) - (node 2) - (node 3) - (node 5) : 13 miles
(node 1) - (node 2) - (node 4) - (node 6): 13 miles
Diff: 2 Page Ref: 283-286
Main Heading: Shortest Route Problem
Key words: shortest route problem, shortest route problem solution
7
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
38) Consider the network diagram given in Figure 1. Assume that the amount on each branch is
the distance in miles between the respective nodes. Also assume that it is not possible to travel
from a node with a higher number to a node with a lower number. Write the constraint associated
with the second node (node 2) for the 0-1 integer linear programming formulation of the shortest
route problem.
Answer: X12 - X24 - X23 = 0
Diff: 2 Page Ref: 287-289
Main Heading: Shortest Route Problem
Key words: short route prob, integer linear prog form of the short route prob
39) Consider the network diagram given in Figure 1. Assume that the amount on each branch is
the distance in miles between the respective nodes. Also assume that it is not possible to travel
from a node with a higher number to a node with a lower number. Write the constraint associated
with the fifth node (node 5) for the 0-1 integer linear programming formulation of the shortest
route problem.
Answer: X35 + X45 - X46 = 0
Diff: 2 Page Ref: 287-289
Main Heading: Shortest Route Problem
Key words: short route prob, integer linear prog form of the short route prob
40) Consider the network diagram given in Figure 1. Assume that he numbers on the branches
indicate the length of cable (in miles) six nodes on a telecommunication network. What is the
minimum number of miles of cable to be used to connect all six nodes?
Answer: 17 miles
Diff: 2 Page Ref: 291-293
Main Heading: The Minimal Spanning Tree Problem
Key words: minimal span tree prob, solution of minimal span tree prob
8
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
Pro-Carpet company manufactures carpets in Northwest Indiana and delivers them to
warehouses and retail outlets. The network diagram given in the Figure below shows the possible
routes and travel times (in minutes) from the carpet plant to the various warehouses or retail
outlets.
41) Determine the shortest route for a carpet delivery truck from the carpet plant in Valparaiso,
Indiana to warehouses in Hammond - IN, Gary - IN and Merillville - IN. State the total
completion time in minutes or each route
Answer: Valparaiso - Portage - Merillville: 19 minutes
Valparaiso - Portage - Gary: 25 minutes
Valparaiso - Portage - Merillville - Hammond: 30 minutes
Diff: 2 Page Ref: 283-286
Main Heading: Shortest Route Problem
Key words: shortest route problem, shortest route problem solution
42) Determine the shortest route for a carpet delivery truck from the carpet plant in Valparaiso,
Indiana to retail outlets in Portage - IN, Highland - IN, and Lansing, Illinois. State the total
completion time in minutes or each route
Answer: Valparaiso - Portage: 13 minutes
Valparaiso - Portage - Merillville - Hammond - Highland: 35 minutes
Valparaiso - Portage - Merillville - Hammond - Lansing: 37 minutes
Diff: 2 Page Ref: 283-286
Main Heading: Shortest Route Problem
Key words: shortest route problem, shortest route problem solution
9
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
43) Write the constraint associated with the Valparasio (source) node for the 0-1 integer linear
programming formulation of the shortest route problem.
Answer: XVP + XVMG = 1
Diff: 2 Page Ref: 287-289
Main Heading: Shortest Route Problem
Key words: short route prob, integer linear prog form of the short route prob
44) Write the constraint associated with the Lansing (destination) node for the 0-1 integer linear
programming formulation of the shortest route problem.
Answer: XHi-L + XHa-L = 1
Diff: 2 Page Ref: 287-289
Main Heading: Shortest Route Problem
Key words: short route prob, integer linear prog form of the short route prob
45) Draw the network associated with the following constraints for a shortest route problem.
X12 + X13 = 1
X12 - X24 = 0
X13 - X34 = 0
X24 + X34 - X45 = 0
X45 = 1
Answer:
10
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
Consider the following network, which shows the location of various facilities within a youth
camp and the distances (in tens of yards) between each facility.
46) Walking trails will be constructed to connect all the facilities. In order to preserve the natural
beauty of the camp (and to minimize the construction time and cost), the directors want to
determine which paths should be constructed. Use this network to determine which paths should
be built.
Answer: Minimal spanning tree shown in bold.
11
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
47) The camp nurse is stationed at Facility B. What is the shortest route from B to C?
Answer: B to G to E to C for a total of 30.
Diff: 1 Page Ref: 283-286
Main Heading: Shortest Route Problem
Key words: network flow problem, shortest route
12
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
Consider the following network, which shows the location of various facilities within a youth
camp and the distances (in tens of yards) between each facility. There is a swampy area between
facility A and E.
48) Walking trails will be constructed to connect all the facilities. In order to preserve the natural
beauty of the camp (and to minimize the construction time and cost), the directors want to
determine which paths should be constructed. Use this network to determine which paths should
be built.
13
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
49) A clean up crew visits is stationed at facility D and wants to take the shortest route to each
site. They usually clean up facilities C, E, A and F on the same day and therefore want the
shortest route from D to each facility. . Recommend a route for the crew to leave from D, clean
up each facility one after the other, and return to facility D. (Assume all paths are accessible.)
Answer: D to E to F to C to A to D. Total distance = 47. This is really a small version of the
traveling salesman problem. Doing the minimal spanning tree prior to this problem may be
helpful.
Diff: 2 Page Ref: 283-286
Main Heading: Network Models
Key words: shortest route problem
50) A clean up crew is stationed at facility F and wants to take the shortest route to each site.
They usually clean up facilities B and A on the same day and therefore want the shortest route
from F to each facility. Recommend a route for the crew to leave from F, clean up each facility
A and B, and then return to facility D. (Assume all paths are accessible.)
Answer: F-E-G-B-D-A-C-F for a total of 77. (This is a small version of the traveling salesmen
problem. Doing the minimal spanning tree prior to this problem may be helpful.). The clean up
crew may want to add additional facilities on the days they clean up A and B if they have time.
Diff: 2 Page Ref: 283-286
Main Heading: Network Models
Key words: shortest route problem
14
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
Refer to the figure below to answer the following questions.
Figure 3
51) Consider the network diagram given in Figure 3 with the indicated flow capacities along
each branch. Determine the maximal flow from source node 1 to destination node 9.
Answer: maximum flow: 12
Diff: 3 Page Ref: 294-297
Main Heading: Maximal Flow Problem
Key words: maximal flow problem, solution of the maximal flow problem
52) Consider the network diagram given in Figure 3 with the indicated flow capacities along
each branch. Determine the maximal flow on the following path: node 1 to node 2 to node 7 to
destination node 9.
Answer: maximum flow: 5
Diff: 2 Page Ref: 294-297
Main Heading: Maximal Flow Problem
Key words: maximal flow problem, solution of the maximal flow problem
53) Consider the network diagram given in Figure 3 with the indicated flow capacities along
each branch. What is the objective function for the 0-1 integer linear programming formulation
of the maximal flow problem?
Answer: maximize Z = X91
Diff: 3 Page Ref: 297-300
Main Heading: Maximal Flow Problem
Key words: max flow prob, 0-1 integer linear prog formulation of the max flow prob
54) Consider the network diagram given in Figure 3 with the indicated flow capacities along
each branch. What is the input- output constraint associated with the first node of the network
diagram for the 0-1 integer linear programming formulation of the maximal flow problem?
Answer: X91 - X12 - X13 - X14 = 0
Diff: 3 Page Ref: 297-300
Main Heading: Maximal Flow Problem
Key words: max flow prob, 0-1 integer linear prog formulation of the max flow prob
15
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall
Another random document with
no related content on Scribd:
Identiche clausole troviamo, non più nelle epigrafi, ma nelle più
tarde e varie (per tempo e per luogo) disposizioni del Codex
Justinianeus, per le quali i coloni semiliberi o i servi della gleba veri e
propri pagavano in natura e danaro, ma più specialmente in natura
(nel che consiste l’essenza della trasformazione del fitto libero in
colonato o in servitù della gleba [480]), secondo una proporzione
immutabile.
Una disposizione di Costantino il grande stabilisce: «Quisquis colonus
plus a domino exigitur quam ante consueverat et quam in
anterioribus temporibus exactus est adeat iudicem.... et facinus
comprobet.... ut ille qui convincitur amplius postulare quam accipere
consueverat, hic facere in posterum prohibeatur» [481]. Eguale
divieto sanciscono Costanzo [482], e, poco più tardi (365 d. C.),
Valentiniano e Valente: «Domini praediorum id quod terra praestat
accipiant; pecuniam non requirant.... nisi consuetudo praedii hoc
exigat» [483]. E, più esplicitamente, due secoli circa più tardi,
Giustiniano ribadiva: «Sancimus colonos nulla deteriore condicione
praegravari.... Caveant autem possessionum domini, in quibus tales
coloni constituti sunt, aliquam innovationem eis inferre.... Si enim
hoc approbatum fuerit et per iudicem pronuntiatum, ipse provinciae
moderator.... omni modo provideat.... veterem consuetudinem in
reditibus praestandis eis observare» [484].
Nè la stabilità dei patti contrattuali si limita ai rapporti fra il
proprietario e il singolo colono, ma deve estendersi a tutti i
discendenti di quest’ultimo. «Et hoc», proseguiva Giustiniano, «tam
iis ipsis colonis quam in subole eorum sancimus, ut et ipsa semel in
fundo nata remaneat in possessione sub iisdem modis
condicionibusque, sub quibus etiam genitoribus eius manere
definivimus» [485].
469.
Cfr. Pausania, 4, 14, 3 sgg. specie 4: «In primo gli Spartani li fanno
giurare di non defezionare mai da loro, e di non tentare alcun altro
mutamento». Questa dicitura sembra riferirsi a un rapporto di Stato
dominatore a popolazione civilmente libera.
470.
In Poetae gr., ed. Bergk, II, fr. 6: trad. it. di G. Fraccaroli, Lirici greci,
Torino, Bocca, II, 90.
471.
Paus., 4, 14, 4.
472.
Pausania discorreva dei Messeni innanzi la grande rivolta della fine del VII
secolo a. C.; dopo di che, soggiunge, essi «passarono nella categoria
degli Iloti» (4, 23, 1; 24, 5). Si deve, in questa frase, supporre anche un
mutamento dei loro obblighi tributari nel senso che, in luogo di un
tributo proporzionale, i nuovi Iloti (come gli antichi) avrebbero pagato
un tributo fisso in natura? Tale deduzione sarebbe arbitraria ed anche
inverosimile, in quanto l’aggravarsi della condizione materiale dei
Messeni non rendeva possibile siffatto mutamento (cfr. pp. 215-16 del
pres. volume). Molto più semplicemente qui si deve trattare del loro
passaggio da coloni liberi o semiliberi a servi della gleba.
È singolare lo sforzo dei moderni per conciliare i passi di Plutarco e di
Pausania, dopo averli interpretati in modo da renderne inconciliabile il
contenuto. Nel suo ottimo libro Le travail dans la Grèce ancienne (pp.
112-13) il Glotz imagina che la condizione degli Iloti della Messenia
fosse stata diversa da quella degli Iloti della Laconia: complicazione
improbabilissima, di cui le fonti tacciono assolutamente o che esse
smentiscono: infatti Pausania, vedemmo, informava che anche i Messeni
furono inscritti fra gli Iloti. Il Beloch poi, nella sua Griechische Geschichte
(2ª ed., I, 1, p. 304, n. 1), suppone che la condizione degli Iloti sia stata
dapprima quella descrittaci da Tirteo e da Pausania, poi quella indicataci
dalla consueta interpretazione di Plutarco. Il guaio si è che Plutarco (loc.
cit.) si riferiva, come Tirteo e Pausania, all’età licurgica e prelicurgica....
Lo stesso storico (lo notiamo implicitamente) cade in qualche altra
inesattezza. Egli considera i Messeni, innanzi la grande rivolta del VII
secolo, quali servi della gleba (p. 206), e interpreta l’espressione
ἀποφορὰ, con cui Plutarco indica il generico tributo degli Iloti, come il
vocabolo tecnico che renda il concetto di «fitto costante» (p. 304, n. 1).
473.
C. I. L., VIII, 2, 10570, § 3 (iscrizione di Suk el Kmis) (in Riccobono;
Baviera; Ferrini, Fontes iuris romani, Florentiae, Barbera, 1909, pp. 362
sgg.).
474.
Ibid., § 4.
475.
Cfr. Journal of hellenic studies, 1897, pp. 418 sgg. Pur troppo,
l’iscrizione, gravemente mutila, non ci illumina (verbalmente almeno) in
modo così completo come quella africana di Suk el Kmis.
476.
In Riccobono ecc., Fontes iuris romani, pp. 352 sgg.; col. I, ll. 6-7, 9, 12,
24; col. II, l. 29 e passim.
478.
Ibid., p. 359 sgg.; col. I, ll. 2 sgg.; col. II, l. 10.
479.
E. Beaudouin, Les grands domaines dans l’Empire romain, in Nouv. Revue
hist. de droit français et étranger, 1898, pp. 556 sgg.
480.
Cod. Just., 11, 48 (47), 5: «Domini praediorum id quod terra praestat
accipiant, pecuniam non requirant; cfr. Fustel de Coulanges, Recherches
sur quelques probl. d’histoire, pp. 1-82; Idem, Institutions politiques:
L’invasion germanique ecc., pp. 142-43; L’alleu et le domain rural (Paris,
1899), pp. 77-79. 406; Le domain rural in Revue des deux mondes,
1886, pp. 855-56 (trad. it. in Bibl. di st. economica del Pareto-Ciccotti,
II, 1); Mitteis, in Hermes (1895), p. 606; E. Costa, in Bullett. Ist. dir.
rom., 1901 (1902), pp. 50 sgg.; Schulten, Colonus, in Dizion. epigr. del
De Ruggiero, pp. 459-460; E. Beaudouin, op. cit., in Nouv. Revue hist. de
droit français et étranger, 1897, pp. 708, 709, note 1-2; 1898, 56-57; G.
Luzzatto, I servi della gleba nelle grandi proprietà ecclesiastiche, Pisa,
Spoerri, 1910, pp. 143 sgg., 179 sgg.
481.
Cod. Iust., 11, 49 (50).
482.
Cod. Iust., 41, 47 (48) 1 (a. 328).
483.
Cod. Iust., 11, 48 (47), 5.
484.
Cod. Iust., 41, 47 (48), 23, 1-2.
485.
Ibid., § 3.
486.
Cfr. anche l’epigrafe d’Henchir Mettich in Riccobono ecc., op. cit., pp. 374
sgg., ll. 11 sgg.; Beaudouin, in loc. cit., 708-09, note, e Cod. Iust., 11, 48
(47), 8, 1, ecc.
488.
Cfr. Beaudouin, in Nouv. Revue hist. de droit français et étranger, 1898,
pp. 547 sgg.
489.
Plin., Ep., 9, 37, 2 sgg. Cfr. Dig., 19, 2, 25, 6: «Partiarius colonus quasi
societatis iure et damnum et lucrum cum domino fundi partitur».
490.
Dareste; Haussoulier; Reinach, Inscriptions juridiques grecques, II, (p.
238), XIII bis, § 3.
491.
Gu. Roscher, Traité d’économie politique rurale (trad. fr.), Paris, 1888, pp.
235 e sgg.
INDICE.
Introduzione ix
Disegno della storia politica della Grecia
antica; Obietto del presente studio e suoi
limiti; Il concetto di «progresso» e di
«decadenza»; Storia e fonti storiche.
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside
the United States, check the laws of your country in addition to
the terms of this agreement before downloading, copying,
displaying, performing, distributing or creating derivative works
based on this work or any other Project Gutenberg™ work. The
Foundation makes no representations concerning the copyright
status of any work in any country other than the United States.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must,
at no additional cost, fee or expense to the user, provide a copy,
a means of exporting a copy, or a means of obtaining a copy
upon request, of the work in its original “Plain Vanilla ASCII” or
other form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.
• You pay a royalty fee of 20% of the gross profits you derive
from the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.F.
Most people start at our website which has the main PG search
facility: www.gutenberg.org.