Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Aachen
Shaker
1997
|
| Ausgabe: | Als Ms. gedr. |
| Schriftenreihe: | Berichte aus der Informatik
|
| Schlagworte: | |
| Beschreibung: | Zugl.: Heidelberg, Univ., Diss., 1997 |
| Beschreibung: | X, 150 S. graph. Darst. |
| ISBN: | 3826532775 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021940486 | ||
| 003 | DE-604 | ||
| 005 | 20040302000000.0 | ||
| 007 | t | ||
| 008 | 980526s1997 d||| m||| 00||| eng d | ||
| 020 | |a 3826532775 |9 3-8265-3277-5 | ||
| 035 | |a (OCoLC)75843261 | ||
| 035 | |a (DE-599)BVBBV021940486 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Christof, Thomas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization |c Thomas Christof |
| 250 | |a Als Ms. gedr. | ||
| 264 | 1 | |a Aachen |b Shaker |c 1997 | |
| 300 | |a X, 150 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Berichte aus der Informatik | |
| 500 | |a Zugl.: Heidelberg, Univ., Diss., 1997 | ||
| 650 | 0 | 7 | |a Schnittebenenverfahren |0 (DE-588)4413142-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Branch-and-Bound-Methode |0 (DE-588)4146449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polytop |0 (DE-588)4175324-0 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Polytop |0 (DE-588)4175324-0 |D s |
| 689 | 0 | 1 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 2 | |a Branch-and-Bound-Methode |0 (DE-588)4146449-7 |D s |
| 689 | 0 | 3 | |a Schnittebenenverfahren |0 (DE-588)4413142-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Branch-and-Bound-Methode |0 (DE-588)4146449-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Polytop |0 (DE-588)4175324-0 |D s |
| 689 | 2 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015155636 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804135900882403328 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Christof, Thomas |
| author_facet | Christof, Thomas |
| author_role | aut |
| author_sort | Christof, Thomas |
| author_variant | t c tc |
| building | Verbundindex |
| bvnumber | BV021940486 |
| classification_rvk | SK 890 |
| ctrlnum | (OCoLC)75843261 (DE-599)BVBBV021940486 |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| edition | Als Ms. gedr. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01759nam a2200481zc 4500</leader><controlfield tag="001">BV021940486</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040302000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980526s1997 d||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3826532775</subfield><subfield code="9">3-8265-3277-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75843261</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021940486</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Christof, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization</subfield><subfield code="c">Thomas Christof</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Als Ms. gedr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Aachen</subfield><subfield code="b">Shaker</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 150 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="0" ind2=" "><subfield code="a">Berichte aus der Informatik</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Heidelberg, Univ., Diss., 1997</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schnittebenenverfahren</subfield><subfield code="0">(DE-588)4413142-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Branch-and-Bound-Methode</subfield><subfield code="0">(DE-588)4146449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polytop</subfield><subfield code="0">(DE-588)4175324-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Polytop</subfield><subfield code="0">(DE-588)4175324-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Branch-and-Bound-Methode</subfield><subfield code="0">(DE-588)4146449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Schnittebenenverfahren</subfield><subfield code="0">(DE-588)4413142-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Branch-and-Bound-Methode</subfield><subfield code="0">(DE-588)4146449-7</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">Polytop</subfield><subfield code="0">(DE-588)4175324-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015155636</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021940486 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:06:54Z |
| indexdate | 2024-07-09T20:47:51Z |
| institution | BVB |
| isbn | 3826532775 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015155636 |
| oclc_num | 75843261 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | X, 150 S. graph. Darst. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Shaker |
| record_format | marc |
| series2 | Berichte aus der Informatik |
| spelling | Christof, Thomas Verfasser aut Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization Thomas Christof Als Ms. gedr. Aachen Shaker 1997 X, 150 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Berichte aus der Informatik Zugl.: Heidelberg, Univ., Diss., 1997 Schnittebenenverfahren (DE-588)4413142-2 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Branch-and-Bound-Methode (DE-588)4146449-7 gnd rswk-swf Polytop (DE-588)4175324-0 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Polytop (DE-588)4175324-0 s Kombinatorische Optimierung (DE-588)4031826-6 s Branch-and-Bound-Methode (DE-588)4146449-7 s Schnittebenenverfahren (DE-588)4413142-2 s 1\p DE-604 DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Christof, Thomas Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization Schnittebenenverfahren (DE-588)4413142-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Branch-and-Bound-Methode (DE-588)4146449-7 gnd Polytop (DE-588)4175324-0 gnd |
| subject_GND | (DE-588)4413142-2 (DE-588)4031826-6 (DE-588)4146449-7 (DE-588)4175324-0 (DE-588)4113937-9 |
| title | Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization |
| title_auth | Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization |
| title_exact_search | Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization |
| title_exact_search_txtP | Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization |
| title_full | Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization Thomas Christof |
| title_fullStr | Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization Thomas Christof |
| title_full_unstemmed | Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization Thomas Christof |
| title_short | Low-dimensional 0 1-polytopes and branch-and-cut in combinatorial optimization |
| title_sort | low dimensional 0 1 polytopes and branch and cut in combinatorial optimization |
| topic | Schnittebenenverfahren (DE-588)4413142-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Branch-and-Bound-Methode (DE-588)4146449-7 gnd Polytop (DE-588)4175324-0 gnd |
| topic_facet | Schnittebenenverfahren Kombinatorische Optimierung Branch-and-Bound-Methode Polytop Hochschulschrift |
| work_keys_str_mv | AT christofthomas lowdimensional01polytopesandbranchandcutincombinatorialoptimization |