About: Set Covering Problem in Transport Nets Expanding Models

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Set Covering Problem in Transport Nets Expanding Models Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://transactions.fs.vsb.cz/
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. 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. (en)
Title	Set Covering Problem in Transport Nets Expanding Models Set Covering Problem in Transport Nets Expanding Models (en)
skos:prefLabel	Set Covering Problem in Transport Nets Expanding Models Set Covering Problem in Transport Nets Expanding Models (en)
skos:notation	RIV/61989100:27230/12:86083414!RIV13-MSM-27230___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Teichmann, Dušan
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta strojní
http://linked.open...dnocenehoVysledku	167593
http://linked.open...ai/riv/idVysledku	RIV/61989100:27230/12:86083414
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	set covering problem, transport nets, linear programming (en)
http://linked.open.../riv/klicoveSlovo	set covering problem transport nets linear programming
http://linked.open...odStatuVydavatele	CZ - Česká republika
http://linked.open...ontrolniKodProRIV	[812C8FD40471]
http://linked.open...i/riv/nazevZdroje	Sborník vědeckých prací Vysoké školy báňské - Technické univerzity Ostrava. Řada strojní
http://linked.open...in/vavai/riv/obor	JO
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	2012
http://linked.open...iv/tvurceVysledku	Teichmann, Dušan Hlavsová, Markéta Konupčíková, Erika
issn	1210-0471
number of pages	6 (xsd:int)
http://localhost/t...ganizacniJednotka	27230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software