Verfügbarkeit: Combinatorial optimization

Combinatorial optimization: Networks and matroids

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Lawler, Eugene L. (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	New York Holt, Rinehart & Winston 1976
Schlagworte:	Algorithmes Algoritmen Analyse de réseau (Planification) Combinatieleer Complexité de calcul (Informatique) Matroiden Matroïdes Netwerken Optimaliseren Optimisation mathématique Algorithms Combinatorial optimization Computational complexity Matroids Network analysis (Planning) Optimierung Mathematik Kombinatorische Optimierung Algorithmus Graphentheorie Matroid Netzplantechnik Netzwerk
Beschreibung:	X, 374 S. graph. Darst.
ISBN:	0030848660

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV002284890
003	DE-604
005	20230105
007	t
008	890928s1976 d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0030848660 \|9 0-03-084866-0
035			\|a (OCoLC)630923073
035			\|a (DE-599)BVBBV002284890
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-91G \|a DE-91 \|a DE-384 \|a DE-355 \|a DE-20 \|a DE-29T \|a DE-634 \|a DE-83 \|a DE-188
050		0	\|a QA402.5
082	0		\|a 519.7
084			\|a QH 400 \|0 (DE-625)141571: \|2 rvk
084			\|a QH 450 \|0 (DE-625)141593: \|2 rvk
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
100	1		\|a Lawler, Eugene L. \|e Verfasser \|4 aut
245	1	0	\|a Combinatorial optimization \|b Networks and matroids
264		1	\|a New York \|b Holt, Rinehart & Winston \|c 1976
300			\|a X, 374 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650		4	\|a Algorithmes
650		7	\|a Algoritmen \|2 gtt
650		4	\|a Analyse de réseau (Planification)
650		7	\|a Combinatieleer \|2 gtt
650		4	\|a Complexité de calcul (Informatique)
650		7	\|a Matroiden \|2 gtt
650		4	\|a Matroïdes
650		7	\|a Netwerken \|2 gtt
650		7	\|a Optimaliseren \|2 gtt
650		4	\|a Optimisation mathématique
650		4	\|a Algorithms
650		4	\|a Combinatorial optimization
650		4	\|a Computational complexity
650		4	\|a Matroids
650		4	\|a Network analysis (Planning)
650	0	7	\|a Optimierung \|0 (DE-588)4043664-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Mathematik \|0 (DE-588)4037944-9 \|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 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
650	0	7	\|a Matroid \|0 (DE-588)4128705-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzplantechnik \|0 (DE-588)4075297-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Netzwerk \|0 (DE-588)4171529-9 \|2 gnd \|9 rswk-swf
689	0	0	\|a Matroid \|0 (DE-588)4128705-8 \|D s
689	0	1	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|D s
689	0		\|5 DE-604
689	1	0	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|D s
689	1	1	\|a Netzplantechnik \|0 (DE-588)4075297-5 \|D s
689	1		\|5 DE-604
689	2	0	\|a Netzwerk \|0 (DE-588)4171529-9 \|D s
689	2	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	2		\|8 1\p \|5 DE-604
689	3	0	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	3		\|8 2\p \|5 DE-604
689	4	0	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	4		\|8 3\p \|5 DE-604
689	5	0	\|a Mathematik \|0 (DE-588)4037944-9 \|D s
689	5		\|8 4\p \|5 DE-604
940	1		\|q TUB-nveb
999			\|a oai:aleph.bib-bvb.de:BVB01-001501636
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

Datensatz im Suchindex

_version_	1804116744187412480
any_adam_object
author	Lawler, Eugene L.
author_facet	Lawler, Eugene L.
author_role	aut
author_sort	Lawler, Eugene L.
author_variant	e l l el ell
building	Verbundindex
bvnumber	BV002284890
callnumber-first	Q - Science
callnumber-label	QA402
callnumber-raw	QA402.5
callnumber-search	QA402.5
callnumber-sort	QA 3402.5
callnumber-subject	QA - Mathematics
classification_rvk	QH 400 QH 450 SK 890
ctrlnum	(OCoLC)630923073 (DE-599)BVBBV002284890
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>03024nam a2200829 c 4500</leader><controlfield tag="001">BV002284890</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230105 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1976 d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0030848660</subfield><subfield code="9">0-03-084866-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)630923073</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002284890</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-91G</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</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">QA402.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 400</subfield><subfield code="0">(DE-625)141571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 450</subfield><subfield code="0">(DE-625)141593:</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="100" ind1="1" ind2=" "><subfield code="a">Lawler, Eugene L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial optimization</subfield><subfield code="b">Networks and matroids</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Holt, Rinehart & Winston</subfield><subfield code="c">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 374 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="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">Combinatieleer</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matroiden</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matroïdes</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">Optimisation mathématique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matroids</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">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">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">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">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="650" ind1="0" ind2="7"><subfield code="a">Matroid</subfield><subfield code="0">(DE-588)4128705-8</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">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Matroid</subfield><subfield code="0">(DE-588)4128705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="1"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</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">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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\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">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" 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="4" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" 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="5" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-nveb</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001501636</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></record></collection>
id	DE-604.BV002284890
illustrated	Illustrated
indexdate	2024-07-09T15:43:22Z
institution	BVB
isbn	0030848660
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-001501636
oclc_num	630923073
open_access_boolean
owner	DE-91G DE-BY-TUM DE-91 DE-BY-TUM DE-384 DE-355 DE-BY-UBR DE-20 DE-29T DE-634 DE-83 DE-188
owner_facet	DE-91G DE-BY-TUM DE-91 DE-BY-TUM DE-384 DE-355 DE-BY-UBR DE-20 DE-29T DE-634 DE-83 DE-188
physical	X, 374 S. graph. Darst.
psigel	TUB-nveb
publishDate	1976
publishDateSearch	1976
publishDateSort	1976
publisher	Holt, Rinehart & Winston
record_format	marc
spelling	Lawler, Eugene L. Verfasser aut Combinatorial optimization Networks and matroids New York Holt, Rinehart & Winston 1976 X, 374 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithmes Algoritmen gtt Analyse de réseau (Planification) Combinatieleer gtt Complexité de calcul (Informatique) Matroiden gtt Matroïdes Netwerken gtt Optimaliseren gtt Optimisation mathématique Algorithms Combinatorial optimization Computational complexity Matroids Network analysis (Planning) Optimierung (DE-588)4043664-0 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Matroid (DE-588)4128705-8 gnd rswk-swf Netzplantechnik (DE-588)4075297-5 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Matroid (DE-588)4128705-8 s Kombinatorische Optimierung (DE-588)4031826-6 s DE-604 Netzplantechnik (DE-588)4075297-5 s Netzwerk (DE-588)4171529-9 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Optimierung (DE-588)4043664-0 s 2\p DE-604 Graphentheorie (DE-588)4113782-6 s 3\p DE-604 Mathematik (DE-588)4037944-9 s 4\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
spellingShingle	Lawler, Eugene L. Combinatorial optimization Networks and matroids Algorithmes Algoritmen gtt Analyse de réseau (Planification) Combinatieleer gtt Complexité de calcul (Informatique) Matroiden gtt Matroïdes Netwerken gtt Optimaliseren gtt Optimisation mathématique Algorithms Combinatorial optimization Computational complexity Matroids Network analysis (Planning) Optimierung (DE-588)4043664-0 gnd Mathematik (DE-588)4037944-9 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd Matroid (DE-588)4128705-8 gnd Netzplantechnik (DE-588)4075297-5 gnd Netzwerk (DE-588)4171529-9 gnd
subject_GND	(DE-588)4043664-0 (DE-588)4037944-9 (DE-588)4031826-6 (DE-588)4001183-5 (DE-588)4113782-6 (DE-588)4128705-8 (DE-588)4075297-5 (DE-588)4171529-9
title	Combinatorial optimization Networks and matroids
title_auth	Combinatorial optimization Networks and matroids
title_exact_search	Combinatorial optimization Networks and matroids
title_full	Combinatorial optimization Networks and matroids
title_fullStr	Combinatorial optimization Networks and matroids
title_full_unstemmed	Combinatorial optimization Networks and matroids
title_short	Combinatorial optimization
title_sort	combinatorial optimization networks and matroids
title_sub	Networks and matroids
topic	Algorithmes Algoritmen gtt Analyse de réseau (Planification) Combinatieleer gtt Complexité de calcul (Informatique) Matroiden gtt Matroïdes Netwerken gtt Optimaliseren gtt Optimisation mathématique Algorithms Combinatorial optimization Computational complexity Matroids Network analysis (Planning) Optimierung (DE-588)4043664-0 gnd Mathematik (DE-588)4037944-9 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd Matroid (DE-588)4128705-8 gnd Netzplantechnik (DE-588)4075297-5 gnd Netzwerk (DE-588)4171529-9 gnd
topic_facet	Algorithmes Algoritmen Analyse de réseau (Planification) Combinatieleer Complexité de calcul (Informatique) Matroiden Matroïdes Netwerken Optimaliseren Optimisation mathématique Algorithms Combinatorial optimization Computational complexity Matroids Network analysis (Planning) Optimierung Mathematik Kombinatorische Optimierung Algorithmus Graphentheorie Matroid Netzplantechnik Netzwerk
work_keys_str_mv	AT lawlereugenel combinatorialoptimizationnetworksandmatroids

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