On the computational complexity of branch and bound search strategies:
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Microfilm Book |
| Language: | English |
| Published: |
1979
|
| Edition: | [Mikrofiche-Ausg.] |
| Subjects: | |
| Item Description: | Includes bibliographical references (leaves 96-100) |
| Physical Description: | VII, 101 leaves graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035638993 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | he|uuuuuuuucu | ||
| 008 | 090721s1979 d||| bm||| 00||| eng d | ||
| 035 | |a (OCoLC)6475205 | ||
| 035 | |a (DE-599)BVBBV035638993 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 100 | 1 | |a Smith, Douglas Robert |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the computational complexity of branch and bound search strategies |c by Douglas Robert Smith |
| 250 | |a [Mikrofiche-Ausg.] | ||
| 264 | 1 | |c 1979 | |
| 300 | |a VII, 101 leaves |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b h |2 rdamedia | ||
| 338 | |b he |2 rdacarrier | ||
| 500 | |a Includes bibliographical references (leaves 96-100) | ||
| 502 | |a Durham, NC, Univ., Diss., 1979 | ||
| 533 | |a Mikroform-Ausgabe |b Ann Arbor, Mich. |c Univ. Microfilms Internat. |d 1980 |e 2 Mikrofiches |n Mikrofiche-Ausg.: |7 s1980 | ||
| 650 | 4 | |a Branch and bound algorithms | |
| 650 | 4 | |a Search theory | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Branch and bound algorithms | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Search theory | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Reproduktion von |a Smith, Douglas Robert |t On the computational complexity of branch and bound search strategies |d 1979 |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017693818 | ||
Record in the Search Index
| _version_ | 1804139318920347648 |
|---|---|
| any_adam_object | |
| author | Smith, Douglas Robert |
| author_facet | Smith, Douglas Robert |
| author_role | aut |
| author_sort | Smith, Douglas Robert |
| author_variant | d r s dr drs |
| building | Verbundindex |
| bvnumber | BV035638993 |
| ctrlnum | (OCoLC)6475205 (DE-599)BVBBV035638993 |
| edition | [Mikrofiche-Ausg.] |
| format | Thesis Microfilm Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01407nam a2200385 c 4500</leader><controlfield tag="001">BV035638993</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">he|uuuuuuuucu</controlfield><controlfield tag="008">090721s1979 d||| bm||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)6475205</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035638993</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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="100" ind1="1" ind2=" "><subfield code="a">Smith, Douglas Robert</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the computational complexity of branch and bound search strategies</subfield><subfield code="c">by Douglas Robert Smith</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[Mikrofiche-Ausg.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 101 leaves</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">h</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">he</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (leaves 96-100)</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Durham, NC, Univ., Diss., 1979</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Mikroform-Ausgabe</subfield><subfield code="b">Ann Arbor, Mich.</subfield><subfield code="c">Univ. Microfilms Internat.</subfield><subfield code="d">1980</subfield><subfield code="e">2 Mikrofiches</subfield><subfield code="n">Mikrofiche-Ausg.:</subfield><subfield code="7">s1980</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and bound algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Search theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and bound algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Search theory</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="776" ind1="0" ind2="8"><subfield code="i">Reproduktion von</subfield><subfield code="a">Smith, Douglas Robert</subfield><subfield code="t">On the computational complexity of branch and bound search strategies</subfield><subfield code="d">1979</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017693818</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035638993 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:42:11Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017693818 |
| oclc_num | 6475205 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | VII, 101 leaves graph. Darst. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| record_format | marc |
| spelling | Smith, Douglas Robert Verfasser aut On the computational complexity of branch and bound search strategies by Douglas Robert Smith [Mikrofiche-Ausg.] 1979 VII, 101 leaves graph. Darst. txt rdacontent h rdamedia he rdacarrier Includes bibliographical references (leaves 96-100) Durham, NC, Univ., Diss., 1979 Mikroform-Ausgabe Ann Arbor, Mich. Univ. Microfilms Internat. 1980 2 Mikrofiches Mikrofiche-Ausg.: s1980 Branch and bound algorithms Search theory Computational complexity (DE-588)4113937-9 Hochschulschrift gnd-content Reproduktion von Smith, Douglas Robert On the computational complexity of branch and bound search strategies 1979 |
| spellingShingle | Smith, Douglas Robert On the computational complexity of branch and bound search strategies Branch and bound algorithms Search theory Computational complexity |
| subject_GND | (DE-588)4113937-9 |
| title | On the computational complexity of branch and bound search strategies |
| title_auth | On the computational complexity of branch and bound search strategies |
| title_exact_search | On the computational complexity of branch and bound search strategies |
| title_full | On the computational complexity of branch and bound search strategies by Douglas Robert Smith |
| title_fullStr | On the computational complexity of branch and bound search strategies by Douglas Robert Smith |
| title_full_unstemmed | On the computational complexity of branch and bound search strategies by Douglas Robert Smith |
| title_short | On the computational complexity of branch and bound search strategies |
| title_sort | on the computational complexity of branch and bound search strategies |
| topic | Branch and bound algorithms Search theory Computational complexity |
| topic_facet | Branch and bound algorithms Search theory Computational complexity Hochschulschrift |
| work_keys_str_mv | AT smithdouglasrobert onthecomputationalcomplexityofbranchandboundsearchstrategies |