<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://bc.itl.waw.pl/style/common/xsl/oai-style.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/
         http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-04-21T12:41:14Z</responseDate>
	<request identifier="oai:bc.itl.waw.pl:300" metadataPrefix="oai_dc" verb="GetRecord">
	https://bc.itl.waw.pl/oai-pmh-repository.xml</request>
	<GetRecord>
	
  <record>
	<header>
		<identifier>oai:bc.itl.waw.pl:300</identifier>
	    <datestamp>2026-02-25T10:56:08Z</datestamp>
		  <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:072:0721</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07</setSpec> 	      <setSpec>dLibraDigitalLibrary</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:071:PPIL</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:072</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:071</setSpec> 	    </header>
		<metadata>
	<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="pl"><![CDATA[A note on the computation of ordered supported non-dominated solutions in the bi-criteria minimum spanning tree problems, Journal of Telecommunications and Information Technology, 2007, nr 4]]></dc:title>
<dc:creator><![CDATA[Clımaco, Joao C. N.]]></dc:creator>
<dc:creator><![CDATA[Silva da, Carlos Gomes]]></dc:creator>
<dc:subject xml:lang="pl"><![CDATA[supported non-dominated solutions]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[minimum spanning tree]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[combinatorial problems]]></dc:subject>
<dc:description xml:lang="pl"><![CDATA[This paper presents a new procedure for computing the set of supported non dominated solutions of bi-criteria minimum spanning tree problems in ordered manner. The procedure is based on the systematic detection of edges which must be replaced in one efficient solution to obtain the adjacent one, in the criteria space. This new approach avoids solving unnecessary problems and makes use of previous computations.]]></dc:description>
<dc:publisher><![CDATA[Instytut Łączności - Państwowy Instytut Badawczy, Warszawa]]></dc:publisher>
<dc:date><![CDATA[2007, nr 4]]></dc:date>
<dc:type xml:lang="pl"><![CDATA[artykuł]]></dc:type>
<dc:format xml:lang="pl"><![CDATA[application/pdf]]></dc:format>
<dc:identifier><![CDATA[http://bc.itl.waw.pl/Content/300/JTIT-2007_4_11.pdf]]></dc:identifier>
<dc:identifier><![CDATA[https://bc.itl.waw.pl/dlibra/publication/edition/300/content]]></dc:identifier>
<dc:identifier><![CDATA[oai:bc.itl.waw.pl:300]]></dc:identifier>
<dc:source xml:lang="pl"><![CDATA[Journal of Telecommunications and Information Technology]]></dc:source>
<dc:language><![CDATA[ang]]></dc:language>
<dc:relation><![CDATA[oai:bc.itl.waw.pl:publication:344]]></dc:relation>
<dc:rights xml:lang="pl"><![CDATA[Biblioteka Naukowa Instytutu Łączności]]></dc:rights>
</oai_dc:dc>

</metadata>
	  </record>	</GetRecord>
</OAI-PMH>
