This HTML5 document contains 43 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/
n14http://localhost/temp/predkladatel/
n6http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/ontology/domain/vavai/
n8http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21260%2F05%3A06121713%21RIV07-MSM-21260___/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21260%2F05%3A06121713%21RIV07-MSM-21260___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
Není k dispozici The paper deals with location-routing problem with nonlivear carts. The problem is NP-Nord, Soheuristic elgorithms are needed to solve the problem. A metaheuristic merging Tabu Search and Variable Neighborhood Search is proposed in this paper. The paper deals with location-routing problem with nonlivear carts. The problem is NP-Nord, Soheuristic elgorithms are needed to solve the problem. A metaheuristic merging Tabu Search and Variable Neighborhood Search is proposed in this paper.
dcterms:title
Metaheuristika k řešení lokalizačně-okružního problému s nelineálními cenami A Metaheuristic to Solve a Location Routing Problem with Non-Linear A Metaheuristic to Solve a Location Routing Problem with Non-Linear
skos:prefLabel
Metaheuristika k řešení lokalizačně-okružního problému s nelineálními cenami A Metaheuristic to Solve a Location Routing Problem with Non-Linear A Metaheuristic to Solve a Location Routing Problem with Non-Linear
skos:notation
RIV/68407700:21260/05:06121713!RIV07-MSM-21260___
n4:strany
375;391
n4:aktivita
n5:Z
n4:aktivity
Z(MSM 212600025)
n4:cisloPeriodika
11
n4:dodaniDat
n11:2007
n4:domaciTvurceVysledku
n6:9390278
n4:druhVysledku
n15:J
n4:duvernostUdaju
n7:S
n4:entitaPredkladatele
n18:predkladatel
n4:idSjednocenehoVysledku
510898
n4:idVysledku
RIV/68407700:21260/05:06121713
n4:jazykVysledku
n13:eng
n4:klicovaSlova
Location; Location-routing tabu search; Variable Neighborhood Search
n4:klicoveSlovo
n9:Variable%20Neighborhood%20Search n9:Location n9:Location-routing%20tabu%20search
n4:kodStatuVydavatele
US - Spojené státy americké
n4:kontrolniKodProRIV
[A6DFB3AD42FF]
n4:nazevZdroje
Journal of Heuristics
n4:obor
n16:BB
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:rokUplatneniVysledku
n11:2005
n4:svazekPeriodika
1
n4:tvurceVysledku
Melechovský, Jan Wolfler-Calvo, R. Prins, Ch.
n4:zamer
n8:MSM%20212600025
s:issn
1381-1231
s:numberOfPages
17
n14:organizacniJednotka
21260