Verfügbarkeit: Optimization algorithms for networks and graphs

Optimization algorithms for networks and graphs:

Gespeichert in:

Bibliographische Detailangaben
Beteilige Person:	Minieka, Edward (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	New York [u.a.] Dekker 1978
Schriftenreihe:	Industrial engineering 1
Schlagwörter:	Algorithmes Algoritmen Analyse de réseau (Planification) Analyse de réseau (planification) Grafen Graphes, Théorie des Netwerken Optimaliseren Algorithms Graph theory Network analysis (Planning) Netzwerk Algorithmus Netzplantechnik Graph Netz Graphentheorie Diskette Kürzester-Weg-Problem Optimierung Netzwerkanalyse
Umfang:	VIII, 356 S. Ill., graph. Darst.
ISBN:	0824766423

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV002253038
003	DE-604
005	20090327
007	t\|
008	890928s1978 xx ad\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0824766423 \|9 0-8247-6642-3
035			\|a (OCoLC)3608464
035			\|a (DE-599)BVBBV002253038
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-91 \|a DE-91G \|a DE-739 \|a DE-355 \|a DE-19 \|a DE-824 \|a DE-83 \|a DE-11 \|a DE-188
050		0	\|a QA166
082	0		\|a 519.7
084			\|a QH 425 \|0 (DE-625)141579: \|2 rvk
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
084			\|a SK 970 \|0 (DE-625)143276: \|2 rvk
084			\|a 90C35 \|2 msc
100	1		\|a Minieka, Edward \|e Verfasser \|4 aut
245	1	0	\|a Optimization algorithms for networks and graphs \|c Edward Minieka
264		1	\|a New York [u.a.] \|b Dekker \|c 1978
300			\|a VIII, 356 S. \|b Ill., graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Industrial engineering \|v 1
650		4	\|a Algorithmes
650		7	\|a Algoritmen \|2 gtt
650		4	\|a Analyse de réseau (Planification)
650		7	\|a Analyse de réseau (planification) \|2 ram
650		7	\|a Grafen \|2 gtt
650		4	\|a Graphes, Théorie des
650		7	\|a Graphes, Théorie des \|2 ram
650		7	\|a Netwerken \|2 gtt
650		7	\|a Optimaliseren \|2 gtt
650		4	\|a Algorithms
650		4	\|a Graph theory
650		4	\|a Network analysis (Planning)
650	0	7	\|a Netzwerk \|0 (DE-588)4171529-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzplantechnik \|0 (DE-588)4075297-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netz \|0 (DE-588)4317151-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Diskette \|0 (DE-588)4122115-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Kürzester-Weg-Problem \|0 (DE-588)4138403-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Optimierung \|0 (DE-588)4043664-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzwerkanalyse \|0 (DE-588)4075298-7 \|2 gnd \|9 rswk-swf
689	0	0	\|a Netzplantechnik \|0 (DE-588)4075297-5 \|D s
689	0	1	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	0		\|5 DE-604
689	1	0	\|a Netzwerkanalyse \|0 (DE-588)4075298-7 \|D s
689	1	1	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	1		\|5 DE-604
689	2	0	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	2	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	2		\|5 DE-604
689	3	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	3	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	3	2	\|a Netz \|0 (DE-588)4317151-5 \|D s
689	3	3	\|a Diskette \|0 (DE-588)4122115-1 \|D s
689	3		\|8 1\p \|5 DE-604
689	4	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	4	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	4	2	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	4	3	\|a Diskette \|0 (DE-588)4122115-1 \|D s
689	4		\|8 2\p \|5 DE-604
689	5	0	\|a Netzwerk \|0 (DE-588)4171529-9 \|D s
689	5		\|8 3\p \|5 DE-604
689	6	0	\|a Kürzester-Weg-Problem \|0 (DE-588)4138403-9 \|D s
689	6		\|8 4\p \|5 DE-604
830		0	\|a Industrial engineering \|v 1 \|w (DE-604)BV002808860 \|9 1
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 2\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 3\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 4\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-001480489

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 MAT 900f 2001 A 25235 0102 MAT 900f 2001 A 25236 0536 M.4.1 0834 OP.30
DE-BY-TUM_katkey	358677
DE-BY-TUM_location	01 LSB
DE-BY-TUM_media_number	040010500355 040010598099 TEMP3131551 TEMP3131552
_version_	1821932280933777408
any_adam_object
author	Minieka, Edward
author_facet	Minieka, Edward
author_role	aut
author_sort	Minieka, Edward
author_variant	e m em
building	Verbundindex
bvnumber	BV002253038
callnumber-first	Q - Science
callnumber-label	QA166
callnumber-raw	QA166
callnumber-search	QA166
callnumber-sort	QA 3166
callnumber-subject	QA - Mathematics
classification_rvk	QH 425 SK 890 SK 970
ctrlnum	(OCoLC)3608464 (DE-599)BVBBV002253038
dewey-full	519.7
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	519 - Probabilities and applied mathematics
dewey-raw	519.7
dewey-search	519.7
dewey-sort	3519.7
dewey-tens	510 - Mathematics
discipline	Mathematik Wirtschaftswissenschaften
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03495nam a2200937 cb4500</leader><controlfield tag="001">BV002253038</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090327 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">890928s1978 xx ad\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0824766423</subfield><subfield code="9">0-8247-6642-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)3608464</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002253038</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-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 425</subfield><subfield code="0">(DE-625)141579:</subfield><subfield code="2">rvk</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="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C35</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Minieka, Edward</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimization algorithms for networks and graphs</subfield><subfield code="c">Edward Minieka</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Dekker</subfield><subfield code="c">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 356 S.</subfield><subfield code="b">Ill., 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">Industrial engineering</subfield><subfield code="v">1</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analyse de réseau (Planification)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analyse de réseau (planification)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes, Théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Netwerken</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimaliseren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netz</subfield><subfield code="0">(DE-588)4317151-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskette</subfield><subfield code="0">(DE-588)4122115-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</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">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="2"><subfield code="a">Netz</subfield><subfield code="0">(DE-588)4317151-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="3"><subfield code="a">Diskette</subfield><subfield code="0">(DE-588)4122115-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="2"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="3"><subfield code="a">Diskette</subfield><subfield code="0">(DE-588)4122115-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Industrial engineering</subfield><subfield code="v">1</subfield><subfield code="w">(DE-604)BV002808860</subfield><subfield code="9">1</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\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><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001480489</subfield></datafield></record></collection>
id	DE-604.BV002253038
illustrated	Illustrated
indexdate	2024-12-20T07:48:21Z
institution	BVB
isbn	0824766423
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-001480489
oclc_num	3608464
open_access_boolean
owner	DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-739 DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-824 DE-83 DE-11 DE-188
owner_facet	DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-739 DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-824 DE-83 DE-11 DE-188
physical	VIII, 356 S. Ill., graph. Darst.
publishDate	1978
publishDateSearch	1978
publishDateSort	1978
publisher	Dekker
record_format	marc
series	Industrial engineering
series2	Industrial engineering
spellingShingle	Minieka, Edward Optimization algorithms for networks and graphs Industrial engineering Algorithmes Algoritmen gtt Analyse de réseau (Planification) Analyse de réseau (planification) ram Grafen gtt Graphes, Théorie des Graphes, Théorie des ram Netwerken gtt Optimaliseren gtt Algorithms Graph theory Network analysis (Planning) Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd Netzplantechnik (DE-588)4075297-5 gnd Graph (DE-588)4021842-9 gnd Netz (DE-588)4317151-5 gnd Graphentheorie (DE-588)4113782-6 gnd Diskette (DE-588)4122115-1 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Optimierung (DE-588)4043664-0 gnd Netzwerkanalyse (DE-588)4075298-7 gnd
subject_GND	(DE-588)4171529-9 (DE-588)4001183-5 (DE-588)4075297-5 (DE-588)4021842-9 (DE-588)4317151-5 (DE-588)4113782-6 (DE-588)4122115-1 (DE-588)4138403-9 (DE-588)4043664-0 (DE-588)4075298-7
title	Optimization algorithms for networks and graphs
title_auth	Optimization algorithms for networks and graphs
title_exact_search	Optimization algorithms for networks and graphs
title_full	Optimization algorithms for networks and graphs Edward Minieka
title_fullStr	Optimization algorithms for networks and graphs Edward Minieka
title_full_unstemmed	Optimization algorithms for networks and graphs Edward Minieka
title_short	Optimization algorithms for networks and graphs
title_sort	optimization algorithms for networks and graphs
topic	Algorithmes Algoritmen gtt Analyse de réseau (Planification) Analyse de réseau (planification) ram Grafen gtt Graphes, Théorie des Graphes, Théorie des ram Netwerken gtt Optimaliseren gtt Algorithms Graph theory Network analysis (Planning) Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd Netzplantechnik (DE-588)4075297-5 gnd Graph (DE-588)4021842-9 gnd Netz (DE-588)4317151-5 gnd Graphentheorie (DE-588)4113782-6 gnd Diskette (DE-588)4122115-1 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Optimierung (DE-588)4043664-0 gnd Netzwerkanalyse (DE-588)4075298-7 gnd
topic_facet	Algorithmes Algoritmen Analyse de réseau (Planification) Analyse de réseau (planification) Grafen Graphes, Théorie des Netwerken Optimaliseren Algorithms Graph theory Network analysis (Planning) Netzwerk Algorithmus Netzplantechnik Graph Netz Graphentheorie Diskette Kürzester-Weg-Problem Optimierung Netzwerkanalyse
volume_link	(DE-604)BV002808860
work_keys_str_mv	AT miniekaedward optimizationalgorithmsfornetworksandgraphs

Verfügbarkeit

Bestellen (Login erforderlich)

Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 MAT 900f 2001 A 25235 Lageplan 0102 MAT 900f 2001 A 25236 Lageplan
Exemplar 1	Ausleihbar Am Standort
Exemplar 2	Ausleihbar Am Standort

Handapparate (nicht verfügbar)

Bestandsangaben von Handapparate (nicht verfügbar)
Signatur:	0536 M.4.1 Lageplan 0834 OP.30 Lageplan
Exemplar 1	Dauerhaft ausgeliehen Ausgeliehen
Exemplar 1	Dauerhaft ausgeliehen Ausgeliehen