A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1987
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Mathematische Besliskunde en Systeemtheorie: Report OS
1987,17 |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010205619 | ||
| 003 | DE-604 | ||
| 005 | 20001222 | ||
| 007 | t | ||
| 008 | 950530s1987 |||| 00||| engod | ||
| 035 | |a (OCoLC)35489800 | ||
| 035 | |a (DE-599)BVBBV010205619 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Boxma, Onno J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture |c O. J. Boxma ; G. A. P. Kindervater |
| 264 | 1 | |a Amsterdam |c 1987 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Mathematische Besliskunde en Systeemtheorie: Report OS |v 1987,17 | |
| 700 | 1 | |a Kindervater, Gerard A. |e Verfasser |4 aut | |
| 810 | 2 | |a Afdeling Mathematische Besliskunde en Systeemtheorie: Report OS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 1987,17 |w (DE-604)BV010205186 |9 1987,17 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006780927 | ||
Datensatz im Suchindex
| _version_ | 1804124610594078720 |
|---|---|
| any_adam_object | |
| author | Boxma, Onno J. Kindervater, Gerard A. |
| author_facet | Boxma, Onno J. Kindervater, Gerard A. |
| author_role | aut aut |
| author_sort | Boxma, Onno J. |
| author_variant | o j b oj ojb g a k ga gak |
| building | Verbundindex |
| bvnumber | BV010205619 |
| ctrlnum | (OCoLC)35489800 (DE-599)BVBBV010205619 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01089nam a2200277 cb4500</leader><controlfield tag="001">BV010205619</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20001222 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950530s1987 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35489800</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010205619</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Boxma, Onno J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture</subfield><subfield code="c">O. J. Boxma ; G. A. P. Kindervater</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Mathematische Besliskunde en Systeemtheorie: Report OS</subfield><subfield code="v">1987,17</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kindervater, Gerard A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Afdeling Mathematische Besliskunde en Systeemtheorie: Report OS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">1987,17</subfield><subfield code="w">(DE-604)BV010205186</subfield><subfield code="9">1987,17</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006780927</subfield></datafield></record></collection> |
| id | DE-604.BV010205619 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:48:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006780927 |
| oclc_num | 35489800 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Mathematische Besliskunde en Systeemtheorie: Report OS |
| spelling | Boxma, Onno J. Verfasser aut A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture O. J. Boxma ; G. A. P. Kindervater Amsterdam 1987 16 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Mathematische Besliskunde en Systeemtheorie: Report OS 1987,17 Kindervater, Gerard A. Verfasser aut Afdeling Mathematische Besliskunde en Systeemtheorie: Report OS Centrum voor Wiskunde en Informatica <Amsterdam> 1987,17 (DE-604)BV010205186 1987,17 |
| spellingShingle | Boxma, Onno J. Kindervater, Gerard A. A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture |
| title | A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture |
| title_auth | A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture |
| title_exact_search | A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture |
| title_full | A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture O. J. Boxma ; G. A. P. Kindervater |
| title_fullStr | A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture O. J. Boxma ; G. A. P. Kindervater |
| title_full_unstemmed | A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture O. J. Boxma ; G. A. P. Kindervater |
| title_short | A queueing network model for analyzing a class of branch and bound algorithms on a master-slave architecture |
| title_sort | a queueing network model for analyzing a class of branch and bound algorithms on a master slave architecture |
| volume_link | (DE-604)BV010205186 |
| work_keys_str_mv | AT boxmaonnoj aqueueingnetworkmodelforanalyzingaclassofbranchandboundalgorithmsonamasterslavearchitecture AT kindervatergerarda aqueueingnetworkmodelforanalyzingaclassofbranchandboundalgorithmsonamasterslavearchitecture |