A cutting plane algorithm for minimum perfect 2-matchings:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Deutsch |
| Veröffentlicht: |
Bonn
1986
|
| Schriftenreihe: | Institut für Ökonometrie und Operations Research <Bonn>: Report
440 |
| Umfang: | 25 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV000642093 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 870928s1986 xx |||| 00||| ger d | ||
| 035 | |a (OCoLC)46036197 | ||
| 035 | |a (DE-599)BVBBV000642093 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-12 | ||
| 084 | |a SI 910 |0 (DE-625)143212: |2 rvk | ||
| 100 | 1 | |a Grötschel, Martin |d 1948- |e Verfasser |0 (DE-588)108975282 |4 aut | |
| 245 | 1 | 0 | |a A cutting plane algorithm for minimum perfect 2-matchings |c by M. Grötschel and O. Holland |
| 264 | 1 | |a Bonn |c 1986 | |
| 300 | |a 25 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Institut für Ökonometrie und Operations Research <Bonn>: Report |v 440 | |
| 830 | 0 | |a Institut für Ökonometrie und Operations Research <Bonn>: Report |v 440 |w (DE-604)BV000010784 |9 440 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-000400010 | |
Datensatz im Suchindex
| _version_ | 1818943250628608000 |
|---|---|
| any_adam_object | |
| author | Grötschel, Martin 1948- |
| author_GND | (DE-588)108975282 |
| author_facet | Grötschel, Martin 1948- |
| author_role | aut |
| author_sort | Grötschel, Martin 1948- |
| author_variant | m g mg |
| building | Verbundindex |
| bvnumber | BV000642093 |
| classification_rvk | SI 910 |
| ctrlnum | (OCoLC)46036197 (DE-599)BVBBV000642093 |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00941nam a2200277 cb4500</leader><controlfield tag="001">BV000642093</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">870928s1986 xx |||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46036197</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000642093</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">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 910</subfield><subfield code="0">(DE-625)143212:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Grötschel, Martin</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)108975282</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A cutting plane algorithm for minimum perfect 2-matchings</subfield><subfield code="c">by M. Grötschel and O. Holland</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 S.</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">Institut für Ökonometrie und Operations Research <Bonn>: Report</subfield><subfield code="v">440</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Institut für Ökonometrie und Operations Research <Bonn>: Report</subfield><subfield code="v">440</subfield><subfield code="w">(DE-604)BV000010784</subfield><subfield code="9">440</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000400010</subfield></datafield></record></collection> |
| id | DE-604.BV000642093 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T07:24:21Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-000400010 |
| oclc_num | 46036197 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 25 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series | Institut für Ökonometrie und Operations Research <Bonn>: Report |
| series2 | Institut für Ökonometrie und Operations Research <Bonn>: Report |
| spelling | Grötschel, Martin 1948- Verfasser (DE-588)108975282 aut A cutting plane algorithm for minimum perfect 2-matchings by M. Grötschel and O. Holland Bonn 1986 25 S. txt rdacontent n rdamedia nc rdacarrier Institut für Ökonometrie und Operations Research <Bonn>: Report 440 Institut für Ökonometrie und Operations Research <Bonn>: Report 440 (DE-604)BV000010784 440 |
| spellingShingle | Grötschel, Martin 1948- A cutting plane algorithm for minimum perfect 2-matchings Institut für Ökonometrie und Operations Research <Bonn>: Report |
| title | A cutting plane algorithm for minimum perfect 2-matchings |
| title_auth | A cutting plane algorithm for minimum perfect 2-matchings |
| title_exact_search | A cutting plane algorithm for minimum perfect 2-matchings |
| title_full | A cutting plane algorithm for minimum perfect 2-matchings by M. Grötschel and O. Holland |
| title_fullStr | A cutting plane algorithm for minimum perfect 2-matchings by M. Grötschel and O. Holland |
| title_full_unstemmed | A cutting plane algorithm for minimum perfect 2-matchings by M. Grötschel and O. Holland |
| title_short | A cutting plane algorithm for minimum perfect 2-matchings |
| title_sort | a cutting plane algorithm for minimum perfect 2 matchings |
| volume_link | (DE-604)BV000010784 |
| work_keys_str_mv | AT grotschelmartin acuttingplanealgorithmforminimumperfect2matchings |