A heuristic for minimum set covers using plausability ordered searches:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
1974
|
| Schlagworte: | |
| Beschreibung: | VII, 193 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021982695 | ||
| 003 | DE-604 | ||
| 005 | 20200414 | ||
| 007 | t | ||
| 008 | 041203s1974 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)1726097 | ||
| 035 | |a (DE-599)BVBBV021982695 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-188 | ||
| 100 | 1 | |a Doherty, Michael Emmett |e Verfasser |0 (DE-588)1208249665 |4 aut | |
| 245 | 1 | 0 | |a A heuristic for minimum set covers using plausability ordered searches |c by Michael Emmett Doherty |
| 264 | 1 | |c 1974 | |
| 300 | |a VII, 193 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Ohio State, Univ., Diss., 1974 | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Integer programming | |
| 650 | 4 | |a Search theory | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015197760 | ||
Datensatz im Suchindex
| _version_ | 1804135956406599680 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Doherty, Michael Emmett |
| author_GND | (DE-588)1208249665 |
| author_facet | Doherty, Michael Emmett |
| author_role | aut |
| author_sort | Doherty, Michael Emmett |
| author_variant | m e d me med |
| building | Verbundindex |
| bvnumber | BV021982695 |
| ctrlnum | (OCoLC)1726097 (DE-599)BVBBV021982695 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00922nam a2200301zc 4500</leader><controlfield tag="001">BV021982695</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200414 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">041203s1974 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1726097</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021982695</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><subfield code="a">DE-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Doherty, Michael Emmett</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1208249665</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A heuristic for minimum set covers using plausability ordered searches</subfield><subfield code="c">by Michael Emmett Doherty</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1974</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 193 Bl.</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="502" ind1=" " ind2=" "><subfield code="a">Ohio State, Univ., Diss., 1974</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integer programming</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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015197760</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021982695 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:10:04Z |
| indexdate | 2024-07-09T20:48:44Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015197760 |
| oclc_num | 1726097 |
| open_access_boolean | |
| owner | DE-706 DE-188 |
| owner_facet | DE-706 DE-188 |
| physical | VII, 193 Bl. graph. Darst. |
| publishDate | 1974 |
| publishDateSearch | 1974 |
| publishDateSort | 1974 |
| record_format | marc |
| spelling | Doherty, Michael Emmett Verfasser (DE-588)1208249665 aut A heuristic for minimum set covers using plausability ordered searches by Michael Emmett Doherty 1974 VII, 193 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Ohio State, Univ., Diss., 1974 Algorithms Integer programming Search theory (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Doherty, Michael Emmett A heuristic for minimum set covers using plausability ordered searches Algorithms Integer programming Search theory |
| subject_GND | (DE-588)4113937-9 |
| title | A heuristic for minimum set covers using plausability ordered searches |
| title_auth | A heuristic for minimum set covers using plausability ordered searches |
| title_exact_search | A heuristic for minimum set covers using plausability ordered searches |
| title_exact_search_txtP | A heuristic for minimum set covers using plausability ordered searches |
| title_full | A heuristic for minimum set covers using plausability ordered searches by Michael Emmett Doherty |
| title_fullStr | A heuristic for minimum set covers using plausability ordered searches by Michael Emmett Doherty |
| title_full_unstemmed | A heuristic for minimum set covers using plausability ordered searches by Michael Emmett Doherty |
| title_short | A heuristic for minimum set covers using plausability ordered searches |
| title_sort | a heuristic for minimum set covers using plausability ordered searches |
| topic | Algorithms Integer programming Search theory |
| topic_facet | Algorithms Integer programming Search theory Hochschulschrift |
| work_keys_str_mv | AT dohertymichaelemmett aheuristicforminimumsetcoversusingplausabilityorderedsearches |