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 1978c
Ausgabe:	3.print.
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) Netzplantechnik Kürzester-Weg-Problem Netzwerk Diskette Netzwerkanalyse Algorithmus Optimierung Graph Graphentheorie Netz
Umfang:	VIII, 356 S.: graph.Darst.
ISBN:	0824766423

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV003618027
003	DE-604
005	00000000000000.0
007	t\|
008	900725s1978 xx \|\|\|\| 00\|\|\| eng d
020			\|a 0824766423 \|9 0-8247-6642-3
035			\|a (OCoLC)3608464
035			\|a (DE-599)BVBBV003618027
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-384 \|a DE-703
050		0	\|a QA166
082	0		\|a 519.7
084			\|a SK 970 \|0 (DE-625)143276: \|2 rvk
100	1		\|a Minieka, Edward \|e Verfasser \|4 aut
245	1	0	\|a Optimization algorithms for networks and graphs
250			\|a 3.print.
264		1	\|a New York u.a. \|b Dekker \|c 1978c
300			\|a VIII, 356 S.: 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 Netzplantechnik \|0 (DE-588)4075297-5 \|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 Netzwerk \|0 (DE-588)4171529-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Diskette \|0 (DE-588)4122115-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzwerkanalyse \|0 (DE-588)4075298-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Optimierung \|0 (DE-588)4043664-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netz \|0 (DE-588)4317151-5 \|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 Algorithmus \|0 (DE-588)4001183-5 \|D s
689	1	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	1	2	\|a Netz \|0 (DE-588)4317151-5 \|D s
689	1	3	\|a Diskette \|0 (DE-588)4122115-1 \|D s
689	1		\|8 1\p \|5 DE-604
689	2	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	2	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	2	2	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	2	3	\|a Diskette \|0 (DE-588)4122115-1 \|D s
689	2		\|8 2\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 3\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 4\p \|5 DE-604
689	5	0	\|a Netzwerk \|0 (DE-588)4171529-9 \|D s
689	5		\|8 5\p \|5 DE-604
689	6	0	\|a Kürzester-Weg-Problem \|0 (DE-588)4138403-9 \|D s
689	6		\|8 6\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
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
943	1		\|a oai:aleph.bib-bvb.de:BVB01-002304400

Datensatz im Suchindex

_version_	1818945965381386240
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	BV003618027
callnumber-first	Q - Science
callnumber-label	QA166
callnumber-raw	QA166
callnumber-search	QA166
callnumber-sort	QA 3166
callnumber-subject	QA - Mathematics
classification_rvk	SK 970
ctrlnum	(OCoLC)3608464 (DE-599)BVBBV003618027
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
edition	3.print.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03514nam a2200937 cb4500</leader><controlfield tag="001">BV003618027</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">900725s1978 xx \|\|\|\| 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)BVBBV003618027</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-384</subfield><subfield code="a">DE-703</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">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</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></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3.print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York u.a.</subfield><subfield code="b">Dekker</subfield><subfield code="c">1978c</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 356 S.: 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">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">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">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">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">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">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">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">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">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">Netz</subfield><subfield code="0">(DE-588)4317151-5</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">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">Netz</subfield><subfield code="0">(DE-588)4317151-5</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">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="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="2"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">2\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">3\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">4\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">5\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">6\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="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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002304400</subfield></datafield></record></collection>
id	DE-604.BV003618027
illustrated	Not Illustrated
indexdate	2024-12-20T08:07:30Z
institution	BVB
isbn	0824766423
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-002304400
oclc_num	3608464
open_access_boolean
owner	DE-384 DE-703
owner_facet	DE-384 DE-703
physical	VIII, 356 S.: graph.Darst.
publishDate	1978
publishDateSearch	1978
publishDateSort	1978
publisher	Dekker
record_format	marc
series	Industrial engineering.
series2	Industrial engineering.
spelling	Minieka, Edward Verfasser aut Optimization algorithms for networks and graphs 3.print. New York u.a. Dekker 1978c VIII, 356 S.: graph.Darst. txt rdacontent n rdamedia nc rdacarrier Industrial engineering. 1. 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) Netzplantechnik (DE-588)4075297-5 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Diskette (DE-588)4122115-1 gnd rswk-swf Netzwerkanalyse (DE-588)4075298-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Netz (DE-588)4317151-5 gnd rswk-swf Netzplantechnik (DE-588)4075297-5 s Graphentheorie (DE-588)4113782-6 s DE-604 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 3\p DE-604 Netzwerkanalyse (DE-588)4075298-7 s 4\p DE-604 Netzwerk (DE-588)4171529-9 s 5\p DE-604 Kürzester-Weg-Problem (DE-588)4138403-9 s 6\p DE-604 Industrial engineering. 1. (DE-604)BV002808860 1. 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
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) Netzplantechnik (DE-588)4075297-5 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Netzwerk (DE-588)4171529-9 gnd Diskette (DE-588)4122115-1 gnd Netzwerkanalyse (DE-588)4075298-7 gnd Algorithmus (DE-588)4001183-5 gnd Optimierung (DE-588)4043664-0 gnd Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd Netz (DE-588)4317151-5 gnd
subject_GND	(DE-588)4075297-5 (DE-588)4138403-9 (DE-588)4171529-9 (DE-588)4122115-1 (DE-588)4075298-7 (DE-588)4001183-5 (DE-588)4043664-0 (DE-588)4021842-9 (DE-588)4113782-6 (DE-588)4317151-5
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
title_fullStr	Optimization algorithms for networks and graphs
title_full_unstemmed	Optimization algorithms for networks and graphs
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) Netzplantechnik (DE-588)4075297-5 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Netzwerk (DE-588)4171529-9 gnd Diskette (DE-588)4122115-1 gnd Netzwerkanalyse (DE-588)4075298-7 gnd Algorithmus (DE-588)4001183-5 gnd Optimierung (DE-588)4043664-0 gnd Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd Netz (DE-588)4317151-5 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) Netzplantechnik Kürzester-Weg-Problem Netzwerk Diskette Netzwerkanalyse Algorithmus Optimierung Graph Graphentheorie Netz
volume_link	(DE-604)BV002808860
work_keys_str_mv	AT miniekaedward optimizationalgorithmsfornetworksandgraphs

Verfügbarkeit

MARC

Datensatz im Suchindex

‌