Deciding uniqueness in norm maximization
Identifieur interne : 001470 ( PascalFrancis/Checkpoint ); précédent : 001469; suivant : 001471Deciding uniqueness in norm maximization
Auteurs : P. Gritzmann [Allemagne] ; V. KleeSource :
- Mathematical programming [ 0025-5610 ] ; 1992.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:93-0190750Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Deciding uniqueness in norm maximization</title>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Univ. Trier, Fb IV mathematik</s1>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>Fb IV mathematik</wicri:noRegion>
<wicri:noRegion>Univ. Trier, Fb IV mathematik</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Klee, V" sort="Klee, V" uniqKey="Klee V" first="V." last="Klee">V. Klee</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">93-0190750</idno>
<date when="1992">1992</date>
<idno type="stanalyst">PASCAL 93-0190750 INIST</idno>
<idno type="RBID">Pascal:93-0190750</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">001678</idno>
<idno type="wicri:Area/PascalFrancis/Curation">001368</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">001470</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001470</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Deciding uniqueness in norm maximization</title>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Univ. Trier, Fb IV mathematik</s1>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>Fb IV mathematik</wicri:noRegion>
<wicri:noRegion>Univ. Trier, Fb IV mathematik</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Klee, V" sort="Klee, V" uniqKey="Klee V" first="V." last="Klee">V. Klee</name>
</author>
</analytic>
<series><title level="j" type="main">Mathematical programming</title>
<title level="j" type="abbreviated">Math. program.</title>
<idno type="ISSN">0025-5610</idno>
<imprint><date when="1992">1992</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Mathematical programming</title>
<title level="j" type="abbreviated">Math. program.</title>
<idno type="ISSN">0025-5610</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Diameter</term>
<term>Global optimum</term>
<term>Maximization</term>
<term>NP hard problem</term>
<term>Optimization</term>
<term>Polynomial time</term>
<term>Polytope</term>
<term>Quadratic programming</term>
<term>Uniqueness theorem</term>
<term>Width</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Optimisation</term>
<term>Optimum global</term>
<term>Théorème unicité</term>
<term>Programmation quadratique</term>
<term>Maximisation</term>
<term>Polytope</term>
<term>Problème NP dur</term>
<term>Algorithme</term>
<term>Temps polynomial</term>
<term>Diamètre</term>
<term>Largeur</term>
<term>Norm</term>
<term>Inradius</term>
<term>Circumradius</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0025-5610</s0>
</fA01>
<fA02 i1="01"><s0>MHPGA4</s0>
</fA02>
<fA03 i2="1"><s0>Math. program.</s0>
</fA03>
<fA05><s2>57</s2>
</fA05>
<fA06><s2>2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Deciding uniqueness in norm maximization</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Complexity issues in numerical optimization</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>GRITZMANN (P.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KLEE (V.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>PARDALOS (P. M.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>VAVASIS (S. A.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Univ. Trier, Fb IV mathematik</s1>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA20><s1>203-214</s1>
</fA20>
<fA21><s1>1992</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>15655</s2>
<s5>354000032628630050</s5>
</fA43>
<fA44><s0>0000</s0>
</fA44>
<fA45><s0>13 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>93-0190750</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i2="1"><s0>Mathematical programming</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC02 i1="01" i2="X"><s0>001D01A02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Optimisation</s0>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Optimization</s0>
</fC03>
<fC03 i1="01" i2="X" l="GER"><s0>Optimierung</s0>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Optimización</s0>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Optimum global</s0>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Global optimum</s0>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Optimo global</s0>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Théorème unicité</s0>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Uniqueness theorem</s0>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Teorema unicidad</s0>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Programmation quadratique</s0>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Quadratic programming</s0>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Programación cuadrática</s0>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Maximisation</s0>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Maximization</s0>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Maximización</s0>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Polytope</s0>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Polytope</s0>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Politope</s0>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Problème NP dur</s0>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>NP hard problem</s0>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Problema NP duro</s0>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Algorithme</s0>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Algorithm</s0>
</fC03>
<fC03 i1="08" i2="X" l="GER"><s0>Algorithmus</s0>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Algoritmo</s0>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Temps polynomial</s0>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Polynomial time</s0>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Tiempo polinomial</s0>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Diamètre</s0>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Diameter</s0>
</fC03>
<fC03 i1="10" i2="X" l="GER"><s0>Durchmesser</s0>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Diámetro</s0>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Largeur</s0>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Width</s0>
</fC03>
<fC03 i1="11" i2="X" l="GER"><s0>Breite</s0>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Ancho</s0>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Norm</s0>
<s4>INC</s4>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Inradius</s0>
<s4>INC</s4>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Circumradius</s0>
<s4>INC</s4>
</fC03>
<fN21><s1>056</s1>
</fN21>
</pA>
</standard>
</inist>
<affiliations><list><country><li>Allemagne</li>
</country>
</list>
<tree><noCountry><name sortKey="Klee, V" sort="Klee, V" uniqKey="Klee V" first="V." last="Klee">V. Klee</name>
</noCountry>
<country name="Allemagne"><noRegion><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001470 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 001470 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= PascalFrancis |étape= Checkpoint |type= RBID |clé= Pascal:93-0190750 |texte= Deciding uniqueness in norm maximization }}
![]() | This area was generated with Dilib version V0.6.31. | ![]() |