<section name="raw">
    <SEQUENTIAL>
      <record key="001" att1="001" value="LIB906565108" att2="LIB906565108">001   LIB906565108</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="">groetschel, martin</field>
      <field key="104" subkey="a">lovasz, laszlo</field>
      <field key="108" subkey="a">schrijver, alexander</field>
      <field key="331" subkey="">geometric algorithms and combinatorial optimization</field>
      <field key="403" subkey="">1. ed.</field>
      <field key="410" subkey="">berlin, heidelberg, new york</field>
      <field key="412" subkey="">springer-verlag</field>
      <field key="425" subkey="">1988</field>
      <field key="433" subkey="">xii, 362 pp., 23 figures</field>
      <field key="451" subkey="">algorithms and combinatorics; 2</field>
      <field key="451" subkey="h">graham, r.l. (ed.) ; et al.</field>
      <field key="517" subkey="c">from the table of contents: mathematical preliminaries; complexity, oracles, and numerical computation; algorithmic aspects of</field>
      <field key="con" subkey="v">ex sets: formulation of the problems; the ellipsoid method; algorithms for convex bodies; diophantine approximation and basis</field>
      <field key="red" subkey="u">ction; rational polyhedra; combinatorial optimization: some basic examples; combinatorial optimization: a tour d'horizon;</field>
      <field key="sta" subkey="b">le sets in graphs; submodular functions;</field>
      <field key="544" subkey="">12261-A</field>
    </SEQUENTIAL>
  </section>