<section name="raw">
    <SEQUENTIAL>
      <record key="001" att1="001" value="LIB902332302" att2="LIB902332302">001   LIB902332302</record>
      <field key="037" subkey="x">englisch</field>
      <field key="050" subkey="x">Buch</field>
      <field key="076" subkey="">Formalwissenschaft</field>
      <field key="100" subkey="">scott, allen j.</field>
      <field key="331" subkey="">combinatorial programming, spatial analysis and planning</field>
      <field key="403" subkey="">1. ed.</field>
      <field key="410" subkey="">london</field>
      <field key="412" subkey="">methuen</field>
      <field key="425" subkey="">1971</field>
      <field key="433" subkey="">x, 204 pp.</field>
      <field key="517" subkey="c">from the table of contents: introduction; exact methods of solving combinatorial programming problems; heuristic methods of</field>
      <field key="sol" subkey="v">ing combinatorial programming problems; basic elements of spatially-structured combinatorial programs: the assignment,</field>
      <field key="tra" subkey="n">sportation, and trans-shipment problems; trees, paths and circuits; complex networks; location-allocation systems; dynamic</field>
      <field key="loc" subkey="a">tion-allocation systems; special grouping and partitioning problems; conclusion;</field>
      <field key="544" subkey="">5116-A</field>
    </SEQUENTIAL>
  </section>