<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>01135nam a2200361   4500</leader>
  <controlfield tag="001">DLU110121516</controlfield>
  <controlfield tag="005">##20110519</controlfield>
  <controlfield tag="008">##021021s2003    gw a     b    001 0 eng  </controlfield>
  <datafield tag="010" ind1="#" ind2="#">
   <subfield code="a">  2002036693</subfield>
  </datafield>
  <datafield tag="020" ind1="#" ind2="#">
   <subfield code="a">3540443894 (acid-free paper)</subfield>
  </datafield>
  <datafield tag="040" ind1="#" ind2="#">
   <subfield code="a">DLC</subfield>
   <subfield code="c">DLC</subfield>
   <subfield code="d">DLC</subfield>
  </datafield>
  <datafield tag="042" ind1="#" ind2="#">
   <subfield code="a">pcc</subfield>
  </datafield>
  <datafield tag="082" ind1="#" ind2="#">
   <subfield code="a">519.3</subfield>
   <subfield code="b">SC-A</subfield>
  </datafield>
  <datafield tag="100" ind1="#" ind2="#">
   <subfield code="a">Schrijver, A.</subfield>
  </datafield>
  <datafield tag="245" ind1="#" ind2="#">
   <subfield code="a">Combinatorial optimization :</subfield>
   <subfield code="b">polyhedra and efficiency.</subfield>
   <subfield code="n">t.I /</subfield>
   <subfield code="c">Alexander Schrijver.</subfield>
  </datafield>
  <datafield tag="260" ind1="#" ind2="#">
   <subfield code="a">Berlin ;</subfield>
   <subfield code="a">New York :</subfield>
   <subfield code="b">Springer,</subfield>
   <subfield code="c">c2003.</subfield>
  </datafield>
  <datafield tag="300" ind1="#" ind2="#">
   <subfield code="a">3 v. (xxxvii, 1881 p.) :</subfield>
   <subfield code="b">ill. ;</subfield>
   <subfield code="c">21X30 cm.</subfield>
  </datafield>
  <datafield tag="440" ind1="#" ind2="#">
   <subfield code="a">Algorithms and combinatorics,</subfield>
   <subfield code="x">0937-5511 ;</subfield>
   <subfield code="v">24</subfield>
  </datafield>
  <datafield tag="504" ind1="#" ind2="#">
   <subfield code="a">Includes bibliographical references (p. [1463]-1766) and indexes.</subfield>
  </datafield>
  <datafield tag="505" ind1="#" ind2="#">
   <subfield code="a">v. A. Paths, flows, matchings -- v. B. Matroids, trees, stable sets -- v. C. Disjoint paths, hypergraphs.</subfield>
  </datafield>
  <datafield tag="650" ind1="#" ind2="#">
   <subfield code="a">Combinatorial optimization.</subfield>
  </datafield>
  <datafield tag="923" ind1="#" ind2="#">
   <subfield code="a">01/2011TN</subfield>
  </datafield>
  <datafield tag="990" ind1="#" ind2="#">
   <subfield code="a">t.I</subfield>
  </datafield>
  <datafield tag="991" ind1="#" ind2="#">
   <subfield code="a">GT</subfield>
  </datafield>
  <datafield tag="992" ind1="#" ind2="#">
   <subfield code="a">0</subfield>
  </datafield>
  <datafield tag="994" ind1="#" ind2="#">
   <subfield code="a">KTN</subfield>
  </datafield>
  <datafield tag="900" ind1="#" ind2="#">
   <subfield code="a">True</subfield>
  </datafield>
  <datafield tag="911" ind1="#" ind2="#">
   <subfield code="a">Đào Thị Thu Huyền</subfield>
  </datafield>
  <datafield tag="925" ind1="#" ind2="#">
   <subfield code="a">G</subfield>
  </datafield>
  <datafield tag="926" ind1="#" ind2="#">
   <subfield code="a">A</subfield>
  </datafield>
  <datafield tag="927" ind1="#" ind2="#">
   <subfield code="a">SH</subfield>
  </datafield>
  <datafield tag="980" ind1="#" ind2="#">
   <subfield code="a">Thư viện Trường Đại học Đà Lạt</subfield>
  </datafield>
 </record>
</collection>
