<section name="raw">
    <SEQUENTIAL>
      <record key="001" att1="001" value="IHS100629404" att2="IHS100629404">001   IHS100629404</record>
      <field key="037" subkey="x">englisch</field>
      <field key="050" subkey="x">Buch</field>
      <field key="076" subkey="">EDV</field>
      <field key="100" subkey="">ford, l.r., jr.</field>
      <field key="104" subkey="a">fulkerson, d.r.</field>
      <field key="331" subkey="">flows in networks</field>
      <field key="335" subkey="a">ford, l.r., sr. ; fulkerson, elbert ; for</field>
      <field key="403" subkey="">2. pr.</field>
      <field key="410" subkey="">princeton, new jersey</field>
      <field key="412" subkey="">princeton university press</field>
      <field key="425" subkey="">1965</field>
      <field key="433" subkey="">xii, 194 pp.</field>
      <field key="517" subkey="c">from the table of contents: static maximal flow: introduction; networks; flows in networks; notation; cuts; maximal flow;</field>
      <field key="dis" subkey="c">onnecting sets and cuts; multiple sources and sinks; the labeling method for solving maximal flow problems; lower bounds</field>
      <field key="ona" subkey="r">c flows; flows in undirected and mixed networks; node capacities and other extensions; linear programming and duality</field>
      <field key="pri" subkey="n">ciples; maximal flow value as a function of two arc capacities; feasibility theorems and combinatorial applications:</field>
      <field key="int" subkey="r">oduction; a supply-demand theorem; a symmetric supply-demand theorem; circulation theorem; the koenig-egervary and menger</field>
      <field key="gra" subkey="p">h theorems; construction of a maximal independent set of admissible cells; a bottleneck assignment problem; unicursal graphs;</field>
      <field key="dil" subkey="w">orth's chain decomposition theorem for partially ordered sets; minimal number of individuals to meet a fixed schedule of</field>
      <field key="tas" subkey="k">s; set representatives; the subgraph problem for directed graphs; matrices composed of o's and 1's; minimal cost flow</field>
      <field key="pro" subkey="b">lems: introduction; the hitchcock problem; the optimal assignment problem; the general minimal cost flow problem; equivalence</field>
      <field key="of" subkey="h">itchcock and minimal cost flow problems; a shortest chain algorithm; the minimal cost supply-demand problem.</field>
      <field key="non" subkey="-">negativedirected cycle costs; the warehousing problem; the caterer problem; maximal dynamic flow; project cost curves;</field>
      <field key="con" subkey="s">tructing minimal cost circulations; multi-terminal maximal flows: introduction; forests, trees, and spanning subtress;</field>
      <field key="rea" subkey="l">ization conditions; equivalent networks; network synthesis;</field>
      <field key="544" subkey="">2218-A</field>
    </SEQUENTIAL>
  </section>