Verfügbarkeit: Algoritmy optimizacii na setjach i grafach

Algoritmy optimizacii na setjach i grafach:

Gespeichert in:

Bibliographische Detailangaben
Beteilige Person:	Minieka, Edward (VerfasserIn)
Format:	Buch
Sprache:	Russisch
Veröffentlicht:	Moskva Mir 1981
Schlagwörter:	Netzwerk Optimierung Kürzester-Weg-Problem Graph Netzwerkanalyse Netz Diskette Netzplantechnik Algorithmus Graphentheorie
Beschreibung:	In kyrill. Schr.
Umfang:	326 S.

Internformat

MARC


LEADER	00000nam a22000002c 4500
001	BV024828077
003	DE-604
005	20110118
007	t\|
008	100417s1981 xx \|\|\|\| 00\|\|\| rus d
035			\|a (OCoLC)916923832
035			\|a (DE-599)BVBBV024828077
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a rus
049			\|a DE-11
100	1		\|a Minieka, Edward \|e Verfasser \|4 aut
240	1	0	\|a Optimization algorithms for networks und graphs
245	1	0	\|a Algoritmy optimizacii na setjach i grafach \|c E. Majnika. Per. s angl. ...
264		1	\|a Moskva \|b Mir \|c 1981
300			\|a 326 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
500			\|a In kyrill. Schr.
650	0	7	\|a Netzwerk \|0 (DE-588)4171529-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 Kürzester-Weg-Problem \|0 (DE-588)4138403-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzwerkanalyse \|0 (DE-588)4075298-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netz \|0 (DE-588)4317151-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Diskette \|0 (DE-588)4122115-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzplantechnik \|0 (DE-588)4075297-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|2 gnd \|9 rswk-swf
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	0	2	\|a Netz \|0 (DE-588)4317151-5 \|D s
689	0	3	\|a Diskette \|0 (DE-588)4122115-1 \|D s
689	0		\|8 1\p \|5 DE-604
689	1	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	1	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	1	2	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	1	3	\|a Diskette \|0 (DE-588)4122115-1 \|D s
689	1		\|8 2\p \|5 DE-604
689	2	0	\|a Netzplantechnik \|0 (DE-588)4075297-5 \|D s
689	2	1	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	2		\|8 3\p \|5 DE-604
689	3	0	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	3	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	3		\|8 4\p \|5 DE-604
689	4	0	\|a Netzwerkanalyse \|0 (DE-588)4075298-7 \|D s
689	4	1	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	4		\|8 5\p \|5 DE-604
689	5	0	\|a Netzwerk \|0 (DE-588)4171529-9 \|D s
689	5		\|8 6\p \|5 DE-604
689	6	0	\|a Kürzester-Weg-Problem \|0 (DE-588)4138403-9 \|D s
689	6		\|8 7\p \|5 DE-604
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
883	1		\|8 5\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 6\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 7\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-019506301

Datensatz im Suchindex

_version_	1818969191329300480
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	BV024828077
ctrlnum	(OCoLC)916923832 (DE-599)BVBBV024828077
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02977nam a22007452c 4500</leader><controlfield tag="001">BV024828077</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110118 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">100417s1981 xx \|\|\|\| 00\|\|\| rus d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)916923832</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024828077</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">rus</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</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="240" ind1="1" ind2="0"><subfield code="a">Optimization algorithms for networks und graphs</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algoritmy optimizacii na setjach i grafach</subfield><subfield code="c">E. Majnika. Per. s angl. ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Moskva</subfield><subfield code="b">Mir</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">326 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="500" ind1=" " ind2=" "><subfield code="a">In kyrill. Schr.</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">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">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">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">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</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">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">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">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">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" 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="0" 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="0" 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="0" 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="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" 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="1" 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="1" 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="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" 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="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="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=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" 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="4" 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="4" ind2=" "><subfield code="8">5\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">6\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">7\p</subfield><subfield code="5">DE-604</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="883" ind1="1" ind2=" "><subfield code="8">5\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">6\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">7\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-019506301</subfield></datafield></record></collection>
id	DE-604.BV024828077
illustrated	Not Illustrated
indexdate	2024-12-20T14:16:40Z
institution	BVB
language	Russian
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-019506301
oclc_num	916923832
open_access_boolean
owner	DE-11
owner_facet	DE-11
physical	326 S.
publishDate	1981
publishDateSearch	1981
publishDateSort	1981
publisher	Mir
record_format	marc
spelling	Minieka, Edward Verfasser aut Optimization algorithms for networks und graphs Algoritmy optimizacii na setjach i grafach E. Majnika. Per. s angl. ... Moskva Mir 1981 326 S. txt rdacontent n rdamedia nc rdacarrier In kyrill. Schr. Netzwerk (DE-588)4171529-9 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Netzwerkanalyse (DE-588)4075298-7 gnd rswk-swf Netz (DE-588)4317151-5 gnd rswk-swf Diskette (DE-588)4122115-1 gnd rswk-swf Netzplantechnik (DE-588)4075297-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Optimierung (DE-588)4043664-0 s Netz (DE-588)4317151-5 s Diskette (DE-588)4122115-1 s 1\p DE-604 Graph (DE-588)4021842-9 s 2\p DE-604 Netzplantechnik (DE-588)4075297-5 s Graphentheorie (DE-588)4113782-6 s 3\p DE-604 4\p DE-604 Netzwerkanalyse (DE-588)4075298-7 s 5\p DE-604 Netzwerk (DE-588)4171529-9 s 6\p DE-604 Kürzester-Weg-Problem (DE-588)4138403-9 s 7\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 7\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Minieka, Edward Algoritmy optimizacii na setjach i grafach Netzwerk (DE-588)4171529-9 gnd Optimierung (DE-588)4043664-0 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Graph (DE-588)4021842-9 gnd Netzwerkanalyse (DE-588)4075298-7 gnd Netz (DE-588)4317151-5 gnd Diskette (DE-588)4122115-1 gnd Netzplantechnik (DE-588)4075297-5 gnd Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd
subject_GND	(DE-588)4171529-9 (DE-588)4043664-0 (DE-588)4138403-9 (DE-588)4021842-9 (DE-588)4075298-7 (DE-588)4317151-5 (DE-588)4122115-1 (DE-588)4075297-5 (DE-588)4001183-5 (DE-588)4113782-6
title	Algoritmy optimizacii na setjach i grafach
title_alt	Optimization algorithms for networks und graphs
title_auth	Algoritmy optimizacii na setjach i grafach
title_exact_search	Algoritmy optimizacii na setjach i grafach
title_full	Algoritmy optimizacii na setjach i grafach E. Majnika. Per. s angl. ...
title_fullStr	Algoritmy optimizacii na setjach i grafach E. Majnika. Per. s angl. ...
title_full_unstemmed	Algoritmy optimizacii na setjach i grafach E. Majnika. Per. s angl. ...
title_short	Algoritmy optimizacii na setjach i grafach
title_sort	algoritmy optimizacii na setjach i grafach
topic	Netzwerk (DE-588)4171529-9 gnd Optimierung (DE-588)4043664-0 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Graph (DE-588)4021842-9 gnd Netzwerkanalyse (DE-588)4075298-7 gnd Netz (DE-588)4317151-5 gnd Diskette (DE-588)4122115-1 gnd Netzplantechnik (DE-588)4075297-5 gnd Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd
topic_facet	Netzwerk Optimierung Kürzester-Weg-Problem Graph Netzwerkanalyse Netz Diskette Netzplantechnik Algorithmus Graphentheorie
work_keys_str_mv	AT miniekaedward optimizationalgorithmsfornetworksundgraphs AT miniekaedward algoritmyoptimizaciinasetjachigrafach

Verfügbarkeit

MARC

Datensatz im Suchindex

‌