Combinatorial optimization: polyhedra and efficiency C Disjoint paths, hypergraphs : chapters 70 - 83
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2003
|
| Schriftenreihe: | Algorithms and combinatorics
24,[3] |
| Beschreibung: | XXXIII S., S. 1222 - 1881 graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zcc4500 | ||
|---|---|---|---|
| 001 | BV023893607 | ||
| 003 | DE-604 | ||
| 005 | 20090401000000.0 | ||
| 007 | t | ||
| 008 | 030512s2003 gw d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)916019991 | ||
| 035 | |a (DE-599)BVBBV023893607 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-634 | ||
| 100 | 1 | |a Schrijver, Alexander |d 1948- |e Verfasser |0 (DE-588)13576355X |4 aut | |
| 245 | 1 | 0 | |a Combinatorial optimization |b polyhedra and efficiency |n C |p Disjoint paths, hypergraphs : chapters 70 - 83 |c Alexander Schrijver |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2003 | |
| 300 | |a XXXIII S., S. 1222 - 1881 |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Algorithms and combinatorics |v 24,[3] | |
| 490 | 0 | |a Algorithms and combinatorics |v 24 | |
| 773 | 0 | 8 | |w (DE-604)BV016881642 |g 3 |
| 830 | 0 | |a Algorithms and combinatorics |v 24,[3] |w (DE-604)BV000617357 |9 24,3 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017535666 | ||
Datensatz im Suchindex
| _version_ | 1804139089033691136 |
|---|---|
| any_adam_object | |
| author | Schrijver, Alexander 1948- |
| author_GND | (DE-588)13576355X |
| author_facet | Schrijver, Alexander 1948- |
| author_role | aut |
| author_sort | Schrijver, Alexander 1948- |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV023893607 |
| ctrlnum | (OCoLC)916019991 (DE-599)BVBBV023893607 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01019nam a2200301zcc4500</leader><controlfield tag="001">BV023893607</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090401000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">030512s2003 gw d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)916019991</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023893607</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schrijver, Alexander</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)13576355X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial optimization</subfield><subfield code="b">polyhedra and efficiency</subfield><subfield code="n">C</subfield><subfield code="p">Disjoint paths, hypergraphs : chapters 70 - 83</subfield><subfield code="c">Alexander Schrijver</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXXIII S., S. 1222 - 1881</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">Algorithms and combinatorics</subfield><subfield code="v">24,[3]</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Algorithms and combinatorics</subfield><subfield code="v">24</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="w">(DE-604)BV016881642</subfield><subfield code="g">3</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Algorithms and combinatorics</subfield><subfield code="v">24,[3]</subfield><subfield code="w">(DE-604)BV000617357</subfield><subfield code="9">24,3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017535666</subfield></datafield></record></collection> |
| id | DE-604.BV023893607 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:38:32Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017535666 |
| oclc_num | 916019991 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | XXXIII S., S. 1222 - 1881 graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Springer |
| record_format | marc |
| series | Algorithms and combinatorics |
| series2 | Algorithms and combinatorics |
| spelling | Schrijver, Alexander 1948- Verfasser (DE-588)13576355X aut Combinatorial optimization polyhedra and efficiency C Disjoint paths, hypergraphs : chapters 70 - 83 Alexander Schrijver Berlin [u.a.] Springer 2003 XXXIII S., S. 1222 - 1881 graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithms and combinatorics 24,[3] Algorithms and combinatorics 24 (DE-604)BV016881642 3 Algorithms and combinatorics 24,[3] (DE-604)BV000617357 24,3 |
| spellingShingle | Schrijver, Alexander 1948- Combinatorial optimization polyhedra and efficiency Algorithms and combinatorics |
| title | Combinatorial optimization polyhedra and efficiency |
| title_auth | Combinatorial optimization polyhedra and efficiency |
| title_exact_search | Combinatorial optimization polyhedra and efficiency |
| title_full | Combinatorial optimization polyhedra and efficiency C Disjoint paths, hypergraphs : chapters 70 - 83 Alexander Schrijver |
| title_fullStr | Combinatorial optimization polyhedra and efficiency C Disjoint paths, hypergraphs : chapters 70 - 83 Alexander Schrijver |
| title_full_unstemmed | Combinatorial optimization polyhedra and efficiency C Disjoint paths, hypergraphs : chapters 70 - 83 Alexander Schrijver |
| title_short | Combinatorial optimization |
| title_sort | combinatorial optimization polyhedra and efficiency disjoint paths hypergraphs chapters 70 83 |
| title_sub | polyhedra and efficiency |
| volume_link | (DE-604)BV016881642 (DE-604)BV000617357 |
| work_keys_str_mv | AT schrijveralexander combinatorialoptimizationpolyhedraandefficiencyc |