Verfügbarkeit: Combinatorial algorithms for the generalized circulation problem

Combinatorial algorithms for the generalized circulation problem:

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Goldberg, Andrew V. (VerfasserIn), Plotkin, Serge A. (VerfasserIn), Tardos, Éva 1957- (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Stanford, Calif. 1988
Schriftenreihe:	Stanford University / Computer Science Department: Report STAN-CS 1209
Schlagworte:	Mathematisches Modell Combinatorial algorithms Foreign exchange > Mathematical models Securities > Prices > Mathematical models Stocks > Prices > Mathematical models Netzwerk Optimierung Kombinatorische Optimierung Netzwerkfluss Graph Algorithmus Kombinatorik Quelle
Beschreibung:	36 S.

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV009227389
003	DE-604
005	20160613
007	t
008	940313s1988 \|\|\|\| 00\|\|\| eng d
035			\|a (OCoLC)19318709
035			\|a (DE-599)BVBBV009227389
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-29T \|a DE-91G
050		0	\|a QA76.M41
100	1		\|a Goldberg, Andrew V. \|e Verfasser \|4 aut
245	1	0	\|a Combinatorial algorithms for the generalized circulation problem \|c by A. V. Goldberg, S. A. Plotkin, and É. Tardos
264		1	\|a Stanford, Calif. \|c 1988
300			\|a 36 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Stanford University / Computer Science Department: Report STAN-CS \|v 1209
650		4	\|a Mathematisches Modell
650		4	\|a Combinatorial algorithms
650		4	\|a Foreign exchange \|x Mathematical models
650		4	\|a Securities \|x Prices \|x Mathematical models
650		4	\|a Stocks \|x Prices \|x Mathematical models
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 Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzwerkfluss \|0 (DE-588)4126130-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graph \|0 (DE-588)4021842-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 Kombinatorik \|0 (DE-588)4031824-2 \|2 gnd \|9 rswk-swf
655		7	\|8 1\p \|0 (DE-588)4135952-5 \|a Quelle \|2 gnd-content
689	0	0	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|D s
689	0	1	\|a Netzwerkfluss \|0 (DE-588)4126130-6 \|D s
689	0		\|5 DE-604
689	1	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	1		\|8 2\p \|5 DE-604
689	2	0	\|a Kombinatorik \|0 (DE-588)4031824-2 \|D s
689	2		\|8 3\p \|5 DE-604
689	3	0	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	3		\|8 4\p \|5 DE-604
689	4	0	\|a Graph \|0 (DE-588)4021842-9 \|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
700	1		\|a Plotkin, Serge A. \|e Verfasser \|4 aut
700	1		\|a Tardos, Éva \|d 1957- \|e Verfasser \|0 (DE-588)140445382 \|4 aut
810	2		\|a Computer Science Department: Report STAN-CS \|t Stanford University \|v 1209 \|w (DE-604)BV008928280 \|9 1209
999			\|a oai:aleph.bib-bvb.de:BVB01-006136079
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

Datensatz im Suchindex

_version_	1804123670727098368
any_adam_object
author	Goldberg, Andrew V. Plotkin, Serge A. Tardos, Éva 1957-
author_GND	(DE-588)140445382
author_facet	Goldberg, Andrew V. Plotkin, Serge A. Tardos, Éva 1957-
author_role	aut aut aut
author_sort	Goldberg, Andrew V.
author_variant	a v g av avg s a p sa sap é t ét
building	Verbundindex
bvnumber	BV009227389
callnumber-first	Q - Science
callnumber-label	QA76
callnumber-raw	QA76.M41
callnumber-search	QA76.M41
callnumber-sort	QA 276 M41
callnumber-subject	QA - Mathematics
ctrlnum	(OCoLC)19318709 (DE-599)BVBBV009227389
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02843nam a2200685 cb4500</leader><controlfield tag="001">BV009227389</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160613 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1988 \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19318709</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009227389</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-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.M41</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial algorithms for the generalized circulation problem</subfield><subfield code="c">by A. V. Goldberg, S. A. Plotkin, and É. Tardos</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">36 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">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1209</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematisches Modell</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Foreign exchange</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Securities</subfield><subfield code="x">Prices</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stocks</subfield><subfield code="x">Prices</subfield><subfield code="x">Mathematical models</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">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</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">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">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</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)4135952-5</subfield><subfield code="a">Quelle</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-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=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</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">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">Graph</subfield><subfield code="0">(DE-588)4021842-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">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="700" ind1="1" ind2=" "><subfield code="a">Plotkin, Serge A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tardos, Éva</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140445382</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1209</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1209</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006136079</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></record></collection>
genre	1\p (DE-588)4135952-5 Quelle gnd-content
genre_facet	Quelle
id	DE-604.BV009227389
illustrated	Not Illustrated
indexdate	2024-07-09T17:33:28Z
institution	BVB
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-006136079
oclc_num	19318709
open_access_boolean
owner	DE-29T DE-91G DE-BY-TUM
owner_facet	DE-29T DE-91G DE-BY-TUM
physical	36 S.
publishDate	1988
publishDateSearch	1988
publishDateSort	1988
record_format	marc
series2	Stanford University / Computer Science Department: Report STAN-CS
spelling	Goldberg, Andrew V. Verfasser aut Combinatorial algorithms for the generalized circulation problem by A. V. Goldberg, S. A. Plotkin, and É. Tardos Stanford, Calif. 1988 36 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1209 Mathematisches Modell Combinatorial algorithms Foreign exchange Mathematical models Securities Prices Mathematical models Stocks Prices Mathematical models Netzwerk (DE-588)4171529-9 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf 1\p (DE-588)4135952-5 Quelle gnd-content Kombinatorische Optimierung (DE-588)4031826-6 s Netzwerkfluss (DE-588)4126130-6 s DE-604 Algorithmus (DE-588)4001183-5 s 2\p DE-604 Kombinatorik (DE-588)4031824-2 s 3\p DE-604 Optimierung (DE-588)4043664-0 s 4\p DE-604 Graph (DE-588)4021842-9 s 5\p DE-604 Netzwerk (DE-588)4171529-9 s 6\p DE-604 Plotkin, Serge A. Verfasser aut Tardos, Éva 1957- Verfasser (DE-588)140445382 aut Computer Science Department: Report STAN-CS Stanford University 1209 (DE-604)BV008928280 1209 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	Goldberg, Andrew V. Plotkin, Serge A. Tardos, Éva 1957- Combinatorial algorithms for the generalized circulation problem Mathematisches Modell Combinatorial algorithms Foreign exchange Mathematical models Securities Prices Mathematical models Stocks Prices Mathematical models Netzwerk (DE-588)4171529-9 gnd Optimierung (DE-588)4043664-0 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Netzwerkfluss (DE-588)4126130-6 gnd Graph (DE-588)4021842-9 gnd Algorithmus (DE-588)4001183-5 gnd Kombinatorik (DE-588)4031824-2 gnd
subject_GND	(DE-588)4171529-9 (DE-588)4043664-0 (DE-588)4031826-6 (DE-588)4126130-6 (DE-588)4021842-9 (DE-588)4001183-5 (DE-588)4031824-2 (DE-588)4135952-5
title	Combinatorial algorithms for the generalized circulation problem
title_auth	Combinatorial algorithms for the generalized circulation problem
title_exact_search	Combinatorial algorithms for the generalized circulation problem
title_full	Combinatorial algorithms for the generalized circulation problem by A. V. Goldberg, S. A. Plotkin, and É. Tardos
title_fullStr	Combinatorial algorithms for the generalized circulation problem by A. V. Goldberg, S. A. Plotkin, and É. Tardos
title_full_unstemmed	Combinatorial algorithms for the generalized circulation problem by A. V. Goldberg, S. A. Plotkin, and É. Tardos
title_short	Combinatorial algorithms for the generalized circulation problem
title_sort	combinatorial algorithms for the generalized circulation problem
topic	Mathematisches Modell Combinatorial algorithms Foreign exchange Mathematical models Securities Prices Mathematical models Stocks Prices Mathematical models Netzwerk (DE-588)4171529-9 gnd Optimierung (DE-588)4043664-0 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Netzwerkfluss (DE-588)4126130-6 gnd Graph (DE-588)4021842-9 gnd Algorithmus (DE-588)4001183-5 gnd Kombinatorik (DE-588)4031824-2 gnd
topic_facet	Mathematisches Modell Combinatorial algorithms Foreign exchange Mathematical models Securities Prices Mathematical models Stocks Prices Mathematical models Netzwerk Optimierung Kombinatorische Optimierung Netzwerkfluss Graph Algorithmus Kombinatorik Quelle
volume_link	(DE-604)BV008928280
work_keys_str_mv	AT goldbergandrewv combinatorialalgorithmsforthegeneralizedcirculationproblem AT plotkinsergea combinatorialalgorithmsforthegeneralizedcirculationproblem AT tardoseva combinatorialalgorithmsforthegeneralizedcirculationproblem

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