Optimization of municipalities with extended competence selection
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F44555601%3A13520%2F10%3A00006137" target="_blank" >RIV/44555601:13520/10:00006137 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Optimization of municipalities with extended competence selection
Original language description
An Article deals with mathematical model formulation of optimal branch offices dislocation and with solution of the associated problem. Solution of the problem has three outputs. The first output is evaluation of contemporary state from view of availability of the branch offices. The second output is sensibility analysis of the availability depending on number of branch offices. The third output is post-optimization analysis, which brings an enumeration of relationship between expenditures on branch office running and losses caused by commuting of citizens to municipalities with extended administration.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
AH - Economics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/SP%2F4I2%2F60%2F07" target="_blank" >SP/4I2/60/07: Indicators for assessment and simulation of interactions among environment, economics and social connections</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Prague Economic Papers
ISSN
1210-0455
e-ISSN
—
Volume of the periodical
19
Issue of the periodical within the volume
1
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
14
Pages from-to
—
UT code for WoS article
000277130400002
EID of the result in the Scopus database
—