<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445359803</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317142911.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20111201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10100-010-0134-y</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10100-010-0134-y</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A simplified implementation of the least squares solution for pairwise comparisons matrices</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Marcin Anholcer, Volodymyr Babiy, Sándor Bozóki, Waldemar Koczkodaj]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This is a follow up to &quot;Solution of the least squares method problem of pairwise comparisons matrix” by Bozóki published by this journal in 2008. Familiarity with this paper is essential and assumed. For lower inconsistency and decreased accuracy, our proposed solutions run in seconds instead of days. As such, they may be useful for researchers willing to use the least squares method instead of the geometric means method.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Pairwise comparison matrix</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Least squares method</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Inconsistency analysis</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Generalized reduced gradient algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Optimization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Anholcer</subfield>
   <subfield code="D">Marcin</subfield>
   <subfield code="u">Department of Operations Research, Poznań University of Economics, Al. Niepodległości 10, 61-875, Poznań, Poland</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Babiy</subfield>
   <subfield code="D">Volodymyr</subfield>
   <subfield code="u">Department of Computer Science, McMaster University, 1280 Main Street West, L8S 4L8, Hamilton, ON, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Bozóki</subfield>
   <subfield code="D">Sándor</subfield>
   <subfield code="u">Laboratory on Engineering and Management Intelligence, Research Group of Operations Research and Decision Systems, Computer and Automation Research Institute, Hungarian Academy of Sciences, P.O. Box 63, 1518, Budapest, Hungary</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Koczkodaj</subfield>
   <subfield code="D">Waldemar</subfield>
   <subfield code="u">Department of Computer Science, Laurentian University, 935 Ramsey Lk Rd., P3E 2C6, Sudbury, ON, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Central European Journal of Operations Research</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">19/4(2011-12-01), 439-444</subfield>
   <subfield code="x">1435-246X</subfield>
   <subfield code="q">19:4&lt;439</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">10100</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10100-010-0134-y</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/s10100-010-0134-y</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">Anholcer</subfield>
   <subfield code="D">Marcin</subfield>
   <subfield code="u">Department of Operations Research, Poznań University of Economics, Al. Niepodległości 10, 61-875, Poznań, Poland</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">Babiy</subfield>
   <subfield code="D">Volodymyr</subfield>
   <subfield code="u">Department of Computer Science, McMaster University, 1280 Main Street West, L8S 4L8, Hamilton, ON, Canada</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">Bozóki</subfield>
   <subfield code="D">Sándor</subfield>
   <subfield code="u">Laboratory on Engineering and Management Intelligence, Research Group of Operations Research and Decision Systems, Computer and Automation Research Institute, Hungarian Academy of Sciences, P.O. Box 63, 1518, Budapest, Hungary</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">Koczkodaj</subfield>
   <subfield code="D">Waldemar</subfield>
   <subfield code="u">Department of Computer Science, Laurentian University, 935 Ramsey Lk Rd., P3E 2C6, Sudbury, ON, Canada</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">Central European Journal of Operations Research</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">19/4(2011-12-01), 439-444</subfield>
   <subfield code="x">1435-246X</subfield>
   <subfield code="q">19:4&lt;439</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">10100</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>
