<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-O1T08VP5</identifier><date>2015</date><creator>Hildenbrandt, Achim</creator><creator>Reinelt, Gerhard</creator><relation>documents/doc/O/URN_NBN_SI_doc-O1T08VP5_001.pdf</relation><relation>documents/doc/O/URN_NBN_SI_doc-O1T08VP5_001.txt</relation><format format_type="issue">3</format><format format_type="volume">39</format><format format_type="type">article</format><format format_type="extent">str. 257-260</format><identifier identifier_type="ISSN">0350-5596</identifier><identifier identifier_type="COBISSID">29598503</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-O1T08VP5</identifier><language>eng</language><publisher>Slovensko društvo Informatika</publisher><source>Informatica (Ljubljana)</source><rights>InC</rights><subject language_type_id="slv">genetski algoritmi</subject><subject language_type_id="slv">informatika</subject><subject language_type_id="eng">information science</subject><subject language_type_id="slv">iskanje poti v grafu</subject><subject language_type_id="slv">umetna inteligenca</subject><title>Inter programming models for the target visitation problem</title></Record>