This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n18http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F04%3A00106940%21RIV10-MSM-67985840/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F04%3A00106940%21RIV10-MSM-67985840
rdf:type
skos:Concept n11:Vysledek
dcterms:description
In dial-a-ride items have to be transported from a source to a destination. The characteristics of the servers involved as well as the specific requirements of the rides may vary. Problems are defined on some metric space, and the goal is to find a feasible solution that minimizes a certain objective function. We classify many of such problems according to their computational complexity. In dial-a-ride items have to be transported from a source to a destination. The characteristics of the servers involved as well as the specific requirements of the rides may vary. Problems are defined on some metric space, and the goal is to find a feasible solution that minimizes a certain objective function. We classify many of such problems according to their computational complexity.
dcterms:title
Computer-aided complexity classification of dial-a-ride problems Computer-aided complexity classification of dial-a-ride problems
skos:prefLabel
Computer-aided complexity classification of dial-a-ride problems Computer-aided complexity classification of dial-a-ride problems
skos:notation
RIV/67985840:_____/04:00106940!RIV10-MSM-67985840
n3:aktivita
n12:Z n12:P
n3:aktivity
P(GA201/01/1195), P(IAA1019901), P(LN00A056), P(ME 476), Z(AV0Z1019905)
n3:cisloPeriodika
2
n3:dodaniDat
n16:2010
n3:domaciTvurceVysledku
n15:8679673
n3:druhVysledku
n17:J
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
558524
n3:idVysledku
RIV/67985840:_____/04:00106940
n3:jazykVysledku
n8:eng
n3:klicovaSlova
vehicle routing; dial-a-ride; computational complexity
n3:klicoveSlovo
n7:dial-a-ride n7:computational%20complexity n7:vehicle%20routing
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[CA4E912CCFF5]
n3:nazevZdroje
INFORMS Journal on Computing
n3:obor
n10:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
4
n3:projekt
n14:GA201%2F01%2F1195 n14:ME%20476 n14:LN00A056 n14:IAA1019901
n3:rokUplatneniVysledku
n16:2004
n3:svazekPeriodika
16
n3:tvurceVysledku
de Paepe, W. E. Sgall, Jiří Sitters, R. A. Stougie, L.
n3:wos
000221945500002
n3:zamer
n18:AV0Z1019905
s:issn
1091-9856
s:numberOfPages
13