Set Covering Problem in Transport Nets Expanding Models

Set Covering Problem in Transport Nets Expanding Models

The article deals with the problem of optimal coverage of utility centres in transport network. We can often encounter similar types of tasks in a real life. A lot of cases relate to the public utility systems that mean systems intended for providing basic public services to all population in a cert...

Full description

Bibliographic Details
Main Authors: Dušan TEICHMANN, Markéta HLAVSOVÁ, Erika KONUPČÍKOVÁ
Format: Article
Language:English
Published: VSB-Technical University of Ostrava 2012-06-01
Series:Transactions of the VSB : Technical University of Ostrava
Online Access:http://transactions.fs.vsb.cz/2012-1/1912.pdf
id doaj-6bfbd98d65a04245a37fcbeaacc41714
record_format Article
spelling doaj-6bfbd98d65a04245a37fcbeaacc417142020-11-24T21:53:31ZengVSB-Technical University of OstravaTransactions of the VSB : Technical University of Ostrava1210-04711804-09932012-06-0158119720210.22223/tr.2012-1/1912Set Covering Problem in Transport Nets Expanding ModelsDušan TEICHMANN0Markéta HLAVSOVÁ1Erika KONUPČÍKOVÁ2VŠB – Technical University of Ostrava, Faculty of Mechanical EngineeringVysoká škola chemicko - technologickáVŠB – Technical University of Ostrava, Faculty of Metallurgy and Material EngineeringThe article deals with the problem of optimal coverage of utility centres in transport network. We can often encounter similar types of tasks in a real life. A lot of cases relate to the public utility systems that mean systems intended for providing basic public services to all population in a certain territory. These services can include services of Integrated Rescue System. The tasks of this category are called Dmax tiling tasks in a scientific literature. The classic version of Dmax cover task is known for quite a long time but its shape does not always cover real traffic conditions. The aim of the article is to show other modifications of the basic variation of the tasks. The authors expect the proposed application will enable mathematical apparatus to be used to solve problems of this type to the greater extent. http://transactions.fs.vsb.cz/2012-1/1912.pdf
collection DOAJ
language English
format Article
sources DOAJ
author Dušan TEICHMANN
Markéta HLAVSOVÁ
Erika KONUPČÍKOVÁ
spellingShingle Dušan TEICHMANN
Markéta HLAVSOVÁ
Erika KONUPČÍKOVÁ
Set Covering Problem in Transport Nets Expanding Models
Transactions of the VSB : Technical University of Ostrava
author_facet Dušan TEICHMANN
Markéta HLAVSOVÁ
Erika KONUPČÍKOVÁ
author_sort Dušan TEICHMANN
title Set Covering Problem in Transport Nets Expanding Models
title_short Set Covering Problem in Transport Nets Expanding Models
title_full Set Covering Problem in Transport Nets Expanding Models
title_fullStr Set Covering Problem in Transport Nets Expanding Models
title_full_unstemmed Set Covering Problem in Transport Nets Expanding Models
title_sort set covering problem in transport nets expanding models
publisher VSB-Technical University of Ostrava
series Transactions of the VSB : Technical University of Ostrava
issn 1210-0471
1804-0993
publishDate 2012-06-01
description The article deals with the problem of optimal coverage of utility centres in transport network. We can often encounter similar types of tasks in a real life. A lot of cases relate to the public utility systems that mean systems intended for providing basic public services to all population in a certain territory. These services can include services of Integrated Rescue System. The tasks of this category are called Dmax tiling tasks in a scientific literature. The classic version of Dmax cover task is known for quite a long time but its shape does not always cover real traffic conditions. The aim of the article is to show other modifications of the basic variation of the tasks. The authors expect the proposed application will enable mathematical apparatus to be used to solve problems of this type to the greater extent.
url http://transactions.fs.vsb.cz/2012-1/1912.pdf
work_keys_str_mv AT dusanteichmann setcoveringproblemintransportnetsexpandingmodels
AT marketahlavsova setcoveringproblemintransportnetsexpandingmodels
AT erikakonupcikova setcoveringproblemintransportnetsexpandingmodels
_version_ 1725871641895895040

Similar Items