A unified approach to interior point algorithms for linear complementarity problems:
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin u.a.
Springer
1991
|
| Schriftenreihe: | Lecture notes in computer science
538 |
| Schlagworte: | |
| Beschreibung: | VIII, 108 S. graph. Darst. |
| ISBN: | 3540545093 0387545093 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004534945 | ||
| 003 | DE-604 | ||
| 005 | 20240215 | ||
| 007 | t| | ||
| 008 | 910805s1991 gw d||| |||| 00||| eng d | ||
| 020 | |a 3540545093 |9 3-540-54509-3 | ||
| 020 | |a 0387545093 |9 0-387-54509-3 | ||
| 035 | |a (OCoLC)231220553 | ||
| 035 | |a (DE-599)BVBBV004534945 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-384 |a DE-91G |a DE-703 |a DE-739 |a DE-20 |a DE-19 |a DE-706 |a DE-83 |a DE-11 |a DE-188 | ||
| 084 | |a DAT 352f |2 stub | ||
| 084 | |a MAT 912f |2 stub | ||
| 245 | 1 | 0 | |a A unified approach to interior point algorithms for linear complementarity problems |c M. Kojima ... |
| 264 | 1 | |a Berlin u.a. |b Springer |c 1991 | |
| 300 | |a VIII, 108 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 538 | |
| 650 | 0 | 7 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Lineares Komplementaritätsproblem |0 (DE-588)4198983-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Lineares Komplementaritätsproblem |0 (DE-588)4198983-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Lineares Komplementaritätsproblem |0 (DE-588)4198983-1 |D s |
| 689 | 1 | 1 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Lineares Komplementaritätsproblem |0 (DE-588)4198983-1 |D s |
| 689 | 3 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 3 | |5 DE-604 | |
| 700 | 1 | |a Kojima, Masakazu |e Sonstige |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 538 |w (DE-604)BV000000607 |9 538 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-002792180 | |
Datensatz im Suchindex
| _version_ | 1820874838673195008 |
|---|---|
| adam_text | |
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV004534945 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 352f MAT 912f |
| ctrlnum | (OCoLC)231220553 (DE-599)BVBBV004534945 |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV004534945</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240215</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">910805s1991 gw d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540545093</subfield><subfield code="9">3-540-54509-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387545093</subfield><subfield code="9">0-387-54509-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)231220553</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004534945</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 352f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 912f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A unified approach to interior point algorithms for linear complementarity problems</subfield><subfield code="c">M. Kojima ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 108 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">538</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lineares Komplementaritätsproblem</subfield><subfield code="0">(DE-588)4198983-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Lineares Komplementaritätsproblem</subfield><subfield code="0">(DE-588)4198983-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Lineares Komplementaritätsproblem</subfield><subfield code="0">(DE-588)4198983-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Lineares Komplementaritätsproblem</subfield><subfield code="0">(DE-588)4198983-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kojima, Masakazu</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">538</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">538</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002792180</subfield></datafield></record></collection> |
| id | DE-604.BV004534945 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:06:06Z |
| institution | BVB |
| isbn | 3540545093 0387545093 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002792180 |
| oclc_num | 231220553 |
| open_access_boolean | |
| owner | DE-12 DE-384 DE-91G DE-BY-TUM DE-703 DE-739 DE-20 DE-19 DE-BY-UBM DE-706 DE-83 DE-11 DE-188 |
| owner_facet | DE-12 DE-384 DE-91G DE-BY-TUM DE-703 DE-739 DE-20 DE-19 DE-BY-UBM DE-706 DE-83 DE-11 DE-188 |
| physical | VIII, 108 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | A unified approach to interior point algorithms for linear complementarity problems M. Kojima ... Berlin u.a. Springer 1991 VIII, 108 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 538 Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf Lineares Komplementaritätsproblem (DE-588)4198983-1 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Lineares Komplementaritätsproblem (DE-588)4198983-1 s DE-604 Polynomialzeitalgorithmus (DE-588)4199652-5 s Optimierung (DE-588)4043664-0 s Algorithmus (DE-588)4001183-5 s Kojima, Masakazu Sonstige oth Lecture notes in computer science 538 (DE-604)BV000000607 538 |
| spellingShingle | A unified approach to interior point algorithms for linear complementarity problems Lecture notes in computer science Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Lineares Komplementaritätsproblem (DE-588)4198983-1 gnd Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4199652-5 (DE-588)4198983-1 (DE-588)4043664-0 (DE-588)4001183-5 |
| title | A unified approach to interior point algorithms for linear complementarity problems |
| title_auth | A unified approach to interior point algorithms for linear complementarity problems |
| title_exact_search | A unified approach to interior point algorithms for linear complementarity problems |
| title_full | A unified approach to interior point algorithms for linear complementarity problems M. Kojima ... |
| title_fullStr | A unified approach to interior point algorithms for linear complementarity problems M. Kojima ... |
| title_full_unstemmed | A unified approach to interior point algorithms for linear complementarity problems M. Kojima ... |
| title_short | A unified approach to interior point algorithms for linear complementarity problems |
| title_sort | a unified approach to interior point algorithms for linear complementarity problems |
| topic | Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Lineares Komplementaritätsproblem (DE-588)4198983-1 gnd Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Polynomialzeitalgorithmus Lineares Komplementaritätsproblem Optimierung Algorithmus |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT kojimamasakazu aunifiedapproachtointeriorpointalgorithmsforlinearcomplementarityproblems |