Verfügbarkeit: Linear network optimization

Linear network optimization: algorithms and codes

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Bertsekas, Dimitri P. 1942- (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Cambridge, Mass. u.a. MIT Press 1992
Ausgabe:	2. print.
Schlagworte:	Network analysis (Planning) Mathematical optimization Algorithms Lineare Optimierung Optimierung Lineares Netzwerk Kürzester-Weg-Problem Mathematik Netzwerk Algorithmus Netzwerkanalyse Aufgabensammlung
Beschreibung:	Literaturverz. S. 343 - 355
Beschreibung:	XI, 359 S. graph. Darst.
ISBN:	0262023342

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV009624853
003	DE-604
005	00000000000000.0
007	t
008	940603s1992 xxud\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0262023342 \|9 0-262-02334-2
035			\|a (OCoLC)471763932
035			\|a (DE-599)BVBBV009624853
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
044			\|a xxu \|c XD-US
049			\|a DE-384 \|a DE-29T \|a DE-521 \|a DE-634 \|a DE-83 \|a DE-188
050		0	\|a T57.85.B43 1991
082	0		\|a 658.4/032 20
084			\|a QH 421 \|0 (DE-625)141575: \|2 rvk
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
084			\|a ST 200 \|0 (DE-625)143611: \|2 rvk
084			\|a 90C35 \|2 msc
100	1		\|a Bertsekas, Dimitri P. \|d 1942- \|e Verfasser \|0 (DE-588)171165519 \|4 aut
245	1	0	\|a Linear network optimization \|b algorithms and codes \|c Dimitri P. Bertsekas
250			\|a 2. print.
264		1	\|a Cambridge, Mass. u.a. \|b MIT Press \|c 1992
300			\|a XI, 359 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
500			\|a Literaturverz. S. 343 - 355
650		4	\|a Network analysis (Planning)
650		4	\|a Mathematical optimization
650		4	\|a Algorithms
650	0	7	\|a Lineare Optimierung \|0 (DE-588)4035816-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Optimierung \|0 (DE-588)4043664-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Lineares Netzwerk \|0 (DE-588)4167735-3 \|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 Mathematik \|0 (DE-588)4037944-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 Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzwerkanalyse \|0 (DE-588)4075298-7 \|2 gnd \|9 rswk-swf
655		7	\|8 1\p \|0 (DE-588)4143389-0 \|a Aufgabensammlung \|2 gnd-content
689	0	0	\|a Netzwerk \|0 (DE-588)4171529-9 \|D s
689	0	1	\|a Lineare Optimierung \|0 (DE-588)4035816-1 \|D s
689	0		\|5 DE-604
689	1	0	\|a Lineares Netzwerk \|0 (DE-588)4167735-3 \|D s
689	1	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	1		\|8 2\p \|5 DE-604
689	2	0	\|a Netzwerk \|0 (DE-588)4171529-9 \|D s
689	2	1	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	2		\|8 3\p \|5 DE-604
689	3	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	3		\|8 4\p \|5 DE-604
689	4	0	\|a Mathematik \|0 (DE-588)4037944-9 \|D s
689	4		\|8 5\p \|5 DE-604
689	5	0	\|a Netzwerkanalyse \|0 (DE-588)4075298-7 \|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
999			\|a oai:aleph.bib-bvb.de:BVB01-006360522
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

Datensatz im Suchindex

_version_	1804123964004368384
any_adam_object
author	Bertsekas, Dimitri P. 1942-
author_GND	(DE-588)171165519
author_facet	Bertsekas, Dimitri P. 1942-
author_role	aut
author_sort	Bertsekas, Dimitri P. 1942-
author_variant	d p b dp dpb
building	Verbundindex
bvnumber	BV009624853
callnumber-first	T - Technology
callnumber-label	T57
callnumber-raw	T57.85.B43 1991
callnumber-search	T57.85.B43 1991
callnumber-sort	T 257.85 B43 41991
callnumber-subject	T - General Technology
classification_rvk	QH 421 SK 890 ST 200
ctrlnum	(OCoLC)471763932 (DE-599)BVBBV009624853
dewey-full	658.4/03220
dewey-hundreds	600 - Technology (Applied sciences)
dewey-ones	658 - General management
dewey-raw	658.4/032 20
dewey-search	658.4/032 20
dewey-sort	3658.4 232 220
dewey-tens	650 - Management and auxiliary services
discipline	Informatik Mathematik Wirtschaftswissenschaften
edition	2. print.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03145nam a2200793 c 4500</leader><controlfield tag="001">BV009624853</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940603s1992 xxud\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262023342</subfield><subfield code="9">0-262-02334-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)471763932</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009624853</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.85.B43 1991</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.4/032 20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 421</subfield><subfield code="0">(DE-625)141575:</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">ST 200</subfield><subfield code="0">(DE-625)143611:</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">Bertsekas, Dimitri P.</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)171165519</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear network optimization</subfield><subfield code="b">algorithms and codes</subfield><subfield code="c">Dimitri P. Bertsekas</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. u.a.</subfield><subfield code="b">MIT Press</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 359 S.</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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 343 - 355</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</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">Lineares Netzwerk</subfield><subfield code="0">(DE-588)4167735-3</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">Mathematik</subfield><subfield code="0">(DE-588)4037944-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">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">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4143389-0</subfield><subfield code="a">Aufgabensammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</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">Lineares Netzwerk</subfield><subfield code="0">(DE-588)4167735-3</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=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="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="8">3\p</subfield><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=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</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">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006360522</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></record></collection>
genre	1\p (DE-588)4143389-0 Aufgabensammlung gnd-content
genre_facet	Aufgabensammlung
id	DE-604.BV009624853
illustrated	Illustrated
indexdate	2024-07-09T17:38:08Z
institution	BVB
isbn	0262023342
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-006360522
oclc_num	471763932
open_access_boolean
owner	DE-384 DE-29T DE-521 DE-634 DE-83 DE-188
owner_facet	DE-384 DE-29T DE-521 DE-634 DE-83 DE-188
physical	XI, 359 S. graph. Darst.
publishDate	1992
publishDateSearch	1992
publishDateSort	1992
publisher	MIT Press
record_format	marc
spelling	Bertsekas, Dimitri P. 1942- Verfasser (DE-588)171165519 aut Linear network optimization algorithms and codes Dimitri P. Bertsekas 2. print. Cambridge, Mass. u.a. MIT Press 1992 XI, 359 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. 343 - 355 Network analysis (Planning) Mathematical optimization Algorithms Lineare Optimierung (DE-588)4035816-1 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Lineares Netzwerk (DE-588)4167735-3 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Netzwerkanalyse (DE-588)4075298-7 gnd rswk-swf 1\p (DE-588)4143389-0 Aufgabensammlung gnd-content Netzwerk (DE-588)4171529-9 s Lineare Optimierung (DE-588)4035816-1 s DE-604 Lineares Netzwerk (DE-588)4167735-3 s Optimierung (DE-588)4043664-0 s 2\p DE-604 3\p DE-604 Algorithmus (DE-588)4001183-5 s 4\p DE-604 Mathematik (DE-588)4037944-9 s 5\p DE-604 Netzwerkanalyse (DE-588)4075298-7 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	Bertsekas, Dimitri P. 1942- Linear network optimization algorithms and codes Network analysis (Planning) Mathematical optimization Algorithms Lineare Optimierung (DE-588)4035816-1 gnd Optimierung (DE-588)4043664-0 gnd Lineares Netzwerk (DE-588)4167735-3 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Mathematik (DE-588)4037944-9 gnd Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerkanalyse (DE-588)4075298-7 gnd
subject_GND	(DE-588)4035816-1 (DE-588)4043664-0 (DE-588)4167735-3 (DE-588)4138403-9 (DE-588)4037944-9 (DE-588)4171529-9 (DE-588)4001183-5 (DE-588)4075298-7 (DE-588)4143389-0
title	Linear network optimization algorithms and codes
title_auth	Linear network optimization algorithms and codes
title_exact_search	Linear network optimization algorithms and codes
title_full	Linear network optimization algorithms and codes Dimitri P. Bertsekas
title_fullStr	Linear network optimization algorithms and codes Dimitri P. Bertsekas
title_full_unstemmed	Linear network optimization algorithms and codes Dimitri P. Bertsekas
title_short	Linear network optimization
title_sort	linear network optimization algorithms and codes
title_sub	algorithms and codes
topic	Network analysis (Planning) Mathematical optimization Algorithms Lineare Optimierung (DE-588)4035816-1 gnd Optimierung (DE-588)4043664-0 gnd Lineares Netzwerk (DE-588)4167735-3 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd Mathematik (DE-588)4037944-9 gnd Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerkanalyse (DE-588)4075298-7 gnd
topic_facet	Network analysis (Planning) Mathematical optimization Algorithms Lineare Optimierung Optimierung Lineares Netzwerk Kürzester-Weg-Problem Mathematik Netzwerk Algorithmus Netzwerkanalyse Aufgabensammlung
work_keys_str_mv	AT bertsekasdimitrip linearnetworkoptimizationalgorithmsandcodes

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge