<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445839740</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145340.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00186-011-0356-3</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00186-011-0356-3</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Graph problems arising from parameter identification of discrete dynamical systems</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Steffen Borchers, Sandro Bosio, Rolf Findeisen, Utz-Uwe Haus, Philipp Rumschinski, Robert Weismantel]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper focuses on combinatorial feasibility and optimization problems that arise in the context of parameter identification of discrete dynamical systems. Given a candidate parametric model for a physical system and a set of experimental observations, the objective of parameter identification is to provide estimates of the parameter values for which the model can reproduce the experiments. To this end, we define a finite graph corresponding to the model, to each arc of which a set of parameters is associated. Paths in this graph are regarded as feasible only if the sets of parameters corresponding to the arcs of the path have nonempty intersection. We study feasibility and optimization problems on such feasible paths, focusing on computational complexity. We show that, under certain restrictions on the sets of parameters, some of the problems become tractable, whereas others are NP-hard. In a similar vein, we define and study some graph problems for experimental design, whose goal is to support the scientist in optimally designing new experiments.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 2011</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Graph problems</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Computational complexity</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Dynamical systems</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Parameter identification</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Borchers</subfield>
   <subfield code="D">Steffen</subfield>
   <subfield code="u">Institut für Automatisierungstechnik, Otto-von-Guericke Universität, Universitätsplatz 2, 39106, Magdeburg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Bosio</subfield>
   <subfield code="D">Sandro</subfield>
   <subfield code="u">Institute for Operations Research (IFOR), Eidgenössischen Technischen Hochschule (ETH) Zürich, Rämistrasse 101, 8092, Zürich, Switzerland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Findeisen</subfield>
   <subfield code="D">Rolf</subfield>
   <subfield code="u">Institut für Automatisierungstechnik, Otto-von-Guericke Universität, Universitätsplatz 2, 39106, Magdeburg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Haus</subfield>
   <subfield code="D">Utz-Uwe</subfield>
   <subfield code="u">Institute for Operations Research (IFOR), Eidgenössischen Technischen Hochschule (ETH) Zürich, Rämistrasse 101, 8092, Zürich, Switzerland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Rumschinski</subfield>
   <subfield code="D">Philipp</subfield>
   <subfield code="u">Institut für Automatisierungstechnik, Otto-von-Guericke Universität, Universitätsplatz 2, 39106, Magdeburg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Weismantel</subfield>
   <subfield code="D">Robert</subfield>
   <subfield code="u">Institute for Operations Research (IFOR), Eidgenössischen Technischen Hochschule (ETH) Zürich, Rämistrasse 101, 8092, Zürich, Switzerland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Mathematical Methods of Operations Research</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">73/3(2011-06-01), 381-400</subfield>
   <subfield code="x">1432-2994</subfield>
   <subfield code="q">73:3&lt;381</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">73</subfield>
   <subfield code="o">186</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00186-011-0356-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00186-011-0356-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Borchers</subfield>
   <subfield code="D">Steffen</subfield>
   <subfield code="u">Institut für Automatisierungstechnik, Otto-von-Guericke Universität, Universitätsplatz 2, 39106, Magdeburg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Bosio</subfield>
   <subfield code="D">Sandro</subfield>
   <subfield code="u">Institute for Operations Research (IFOR), Eidgenössischen Technischen Hochschule (ETH) Zürich, Rämistrasse 101, 8092, Zürich, Switzerland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Findeisen</subfield>
   <subfield code="D">Rolf</subfield>
   <subfield code="u">Institut für Automatisierungstechnik, Otto-von-Guericke Universität, Universitätsplatz 2, 39106, Magdeburg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Haus</subfield>
   <subfield code="D">Utz-Uwe</subfield>
   <subfield code="u">Institute for Operations Research (IFOR), Eidgenössischen Technischen Hochschule (ETH) Zürich, Rämistrasse 101, 8092, Zürich, Switzerland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Rumschinski</subfield>
   <subfield code="D">Philipp</subfield>
   <subfield code="u">Institut für Automatisierungstechnik, Otto-von-Guericke Universität, Universitätsplatz 2, 39106, Magdeburg, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Weismantel</subfield>
   <subfield code="D">Robert</subfield>
   <subfield code="u">Institute for Operations Research (IFOR), Eidgenössischen Technischen Hochschule (ETH) Zürich, Rämistrasse 101, 8092, Zürich, Switzerland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Mathematical Methods of Operations Research</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">73/3(2011-06-01), 381-400</subfield>
   <subfield code="x">1432-2994</subfield>
   <subfield code="q">73:3&lt;381</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">73</subfield>
   <subfield code="o">186</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
