Verfügbarkeit: Polytopes, graphs and optimisation | Technische Universität München

Polytopes, graphs and optimisation:

Gespeichert in:

Bibliographische Detailangaben
Beteiligte Personen:	Emeličev, Vladimir A. (VerfasserIn), Kavalev, Michail 1947- (VerfasserIn), Kravcov, M. K. (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Cambridge u.a. Cambridge Univ. Pr. 1984
Schlagwörter:	Graph Konvexes Polytop Polyeder Kombinatorik Polytop Optimierung Kombinatorische Topologie Graphentheorie Mengenlehre Polyedrische Kombinatorik
Beschreibung:	Aus d. Russ. übers. - EST: Mnogogranniki, grafy, optimizacija (engl.)
Umfang:	423 S.
ISBN:	052125597X

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV002033694
003	DE-604
005	19950613
007	t\|
008	890928s1984 xx \|\|\|\| 00\|\|\| eng d
020			\|a 052125597X \|9 0-521-25597-X
035			\|a (OCoLC)605242203
035			\|a (DE-599)BVBBV002033694
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-91G \|a DE-739 \|a DE-188
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
084			\|a MAT 915f \|2 stub
084			\|a MAT 525f \|2 stub
084			\|a MAT 159f \|2 stub
100	1		\|a Emeličev, Vladimir A. \|e Verfasser \|4 aut
240	1	0	\|a Mnogogranniki, grafy, optimizacija
245	1	0	\|a Polytopes, graphs and optimisation \|c Vladimir A. Emeličev ; M. M. Kovalev ; M. K. Kravcov*
264		1	\|a Cambridge u.a. \|b Cambridge Univ. Pr. \|c 1984
300			\|a 423 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
500			\|a Aus d. Russ. übers. - EST: Mnogogranniki, grafy, optimizacija (engl.)
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Konvexes Polytop \|0 (DE-588)4367579-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Polyeder \|0 (DE-588)4132101-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Kombinatorik \|0 (DE-588)4031824-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Polytop \|0 (DE-588)4175324-0 \|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 Topologie \|0 (DE-588)4137530-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Mengenlehre \|0 (DE-588)4074715-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Polyedrische Kombinatorik \|0 (DE-588)4132100-5 \|2 gnd \|9 rswk-swf
689	0	0	\|a Polytop \|0 (DE-588)4175324-0 \|D s
689	0	1	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	0		\|8 1\p \|5 DE-604
689	1	0	\|a Polytop \|0 (DE-588)4175324-0 \|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 Polytop \|0 (DE-588)4175324-0 \|D s
689	2	1	\|a Kombinatorik \|0 (DE-588)4031824-2 \|D s
689	2		\|8 3\p \|5 DE-604
689	3	0	\|a Polyeder \|0 (DE-588)4132101-7 \|D s
689	3	1	\|a Kombinatorik \|0 (DE-588)4031824-2 \|D s
689	3		\|8 4\p \|5 DE-604
689	4	0	\|a Konvexes Polytop \|0 (DE-588)4367579-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 Konvexes Polytop \|0 (DE-588)4367579-7 \|D s
689	5	1	\|a Kombinatorische Topologie \|0 (DE-588)4137530-0 \|D s
689	5		\|8 6\p \|5 DE-604
689	6	0	\|a Mengenlehre \|0 (DE-588)4074715-3 \|D s
689	6		\|8 7\p \|5 DE-604
689	7	0	\|a Polyedrische Kombinatorik \|0 (DE-588)4132100-5 \|D s
689	7		\|8 8\p \|5 DE-604
700	1		\|a Kavalev, Michail \|d 1947- \|e Verfasser \|0 (DE-588)110016955 \|4 aut
700	1		\|a Kravcov, M. K. \|e Verfasser \|4 aut
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
883	1		\|8 8\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-001329398

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 MAT 525f 2001 A 13325 0102 MAT 525f 2001 A 13324
DE-BY-TUM_katkey	212384
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040010509252 040010509241
_version_	1821934640652353537
any_adam_object
author	Emeličev, Vladimir A. Kavalev, Michail 1947- Kravcov, M. K.
author_GND	(DE-588)110016955
author_facet	Emeličev, Vladimir A. Kavalev, Michail 1947- Kravcov, M. K.
author_role	aut aut aut
author_sort	Emeličev, Vladimir A.
author_variant	v a e va vae m k mk m k k mk mkk
building	Verbundindex
bvnumber	BV002033694
classification_rvk	SK 890
classification_tum	MAT 915f MAT 525f MAT 159f
ctrlnum	(OCoLC)605242203 (DE-599)BVBBV002033694
discipline	Mathematik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03438nam a2200829 c 4500</leader><controlfield tag="001">BV002033694</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950613 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">890928s1984 xx \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">052125597X</subfield><subfield code="9">0-521-25597-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)605242203</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002033694</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-739</subfield><subfield code="a">DE-188</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">MAT 915f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 525f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 159f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Emeličev, Vladimir A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Mnogogranniki, grafy, optimizacija</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Polytopes, graphs and optimisation</subfield><subfield code="c">Vladimir A. Emeličev ; M. M. Kovalev ; M. K. Kravcov*</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge u.a.</subfield><subfield code="b">Cambridge Univ. Pr.</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">423 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">Aus d. Russ. übers. - EST: Mnogogranniki, grafy, optimizacija (engl.)</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">Konvexes Polytop</subfield><subfield code="0">(DE-588)4367579-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</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="650" ind1="0" ind2="7"><subfield code="a">Polytop</subfield><subfield code="0">(DE-588)4175324-0</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 Topologie</subfield><subfield code="0">(DE-588)4137530-0</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">Mengenlehre</subfield><subfield code="0">(DE-588)4074715-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polyedrische Kombinatorik</subfield><subfield code="0">(DE-588)4132100-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Polytop</subfield><subfield code="0">(DE-588)4175324-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Polytop</subfield><subfield code="0">(DE-588)4175324-0</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">Polytop</subfield><subfield code="0">(DE-588)4175324-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><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">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</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">Konvexes Polytop</subfield><subfield code="0">(DE-588)4367579-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">Konvexes Polytop</subfield><subfield code="0">(DE-588)4367579-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="1"><subfield code="a">Kombinatorische Topologie</subfield><subfield code="0">(DE-588)4137530-0</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">Mengenlehre</subfield><subfield code="0">(DE-588)4074715-3</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="689" ind1="7" ind2="0"><subfield code="a">Polyedrische Kombinatorik</subfield><subfield code="0">(DE-588)4132100-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="7" ind2=" "><subfield code="8">8\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kavalev, Michail</subfield><subfield code="d">1947-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110016955</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kravcov, M. K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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="883" ind1="1" ind2=" "><subfield code="8">8\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-001329398</subfield></datafield></record></collection>
id	DE-604.BV002033694
illustrated	Not Illustrated
indexdate	2024-12-20T07:45:03Z
institution	BVB
isbn	052125597X
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-001329398
oclc_num	605242203
open_access_boolean
owner	DE-91G DE-BY-TUM DE-739 DE-188
owner_facet	DE-91G DE-BY-TUM DE-739 DE-188
physical	423 S.
publishDate	1984
publishDateSearch	1984
publishDateSort	1984
publisher	Cambridge Univ. Pr.
record_format	marc
spellingShingle	Emeličev, Vladimir A. Kavalev, Michail 1947- Kravcov, M. K. Polytopes, graphs and optimisation Graph (DE-588)4021842-9 gnd Konvexes Polytop (DE-588)4367579-7 gnd Polyeder (DE-588)4132101-7 gnd Kombinatorik (DE-588)4031824-2 gnd Polytop (DE-588)4175324-0 gnd Optimierung (DE-588)4043664-0 gnd Kombinatorische Topologie (DE-588)4137530-0 gnd Graphentheorie (DE-588)4113782-6 gnd Mengenlehre (DE-588)4074715-3 gnd Polyedrische Kombinatorik (DE-588)4132100-5 gnd
subject_GND	(DE-588)4021842-9 (DE-588)4367579-7 (DE-588)4132101-7 (DE-588)4031824-2 (DE-588)4175324-0 (DE-588)4043664-0 (DE-588)4137530-0 (DE-588)4113782-6 (DE-588)4074715-3 (DE-588)4132100-5
title	Polytopes, graphs and optimisation
title_alt	Mnogogranniki, grafy, optimizacija
title_auth	Polytopes, graphs and optimisation
title_exact_search	Polytopes, graphs and optimisation
title_full	Polytopes, graphs and optimisation Vladimir A. Emeličev ; M. M. Kovalev ; M. K. Kravcov*
title_fullStr	Polytopes, graphs and optimisation Vladimir A. Emeličev ; M. M. Kovalev ; M. K. Kravcov*
title_full_unstemmed	Polytopes, graphs and optimisation Vladimir A. Emeličev ; M. M. Kovalev ; M. K. Kravcov*
title_short	Polytopes, graphs and optimisation
title_sort	polytopes graphs and optimisation
topic	Graph (DE-588)4021842-9 gnd Konvexes Polytop (DE-588)4367579-7 gnd Polyeder (DE-588)4132101-7 gnd Kombinatorik (DE-588)4031824-2 gnd Polytop (DE-588)4175324-0 gnd Optimierung (DE-588)4043664-0 gnd Kombinatorische Topologie (DE-588)4137530-0 gnd Graphentheorie (DE-588)4113782-6 gnd Mengenlehre (DE-588)4074715-3 gnd Polyedrische Kombinatorik (DE-588)4132100-5 gnd
topic_facet	Graph Konvexes Polytop Polyeder Kombinatorik Polytop Optimierung Kombinatorische Topologie Graphentheorie Mengenlehre Polyedrische Kombinatorik
work_keys_str_mv	AT emelicevvladimira mnogogrannikigrafyoptimizacija AT kavalevmichail mnogogrannikigrafyoptimizacija AT kravcovmk mnogogrannikigrafyoptimizacija AT emelicevvladimira polytopesgraphsandoptimisation AT kavalevmichail polytopesgraphsandoptimisation AT kravcovmk polytopesgraphsandoptimisation

Verfügbarkeit

Bestellen (Login erforderlich)

Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 MAT 525f 2001 A 13324 Lageplan 0102 MAT 525f 2001 A 13325 Lageplan
Exemplar 1	Ausleihbar Am Standort
Exemplar 2	Ausleihbar Am Standort