Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6420102> ?p ?o }
Showing triples 1 to 51 of
51
with 100 triples per page.
- Q6420102 subject Q6426361.
- Q6420102 subject Q7016313.
- Q6420102 subject Q7214708.
- Q6420102 subject Q7451559.
- Q6420102 subject Q7463500.
- Q6420102 subject Q8250013.
- Q6420102 abstract "The Klee–Minty cube (named after Victor Klee and George J. Minty) is a unit cube whose corners have been slightly perturbed. Klee and Minty demonstrated that Dantzig's simplex algorithm has poor worst-case performance when initialized at one corner of their "squashed cube".In particular, many optimization algorithms for linear optimization exhibit poor performance when applied to the Klee–Minty cube. In 1973 Klee and Minty showed that Dantzig's simplex algorithm was not a polynomial-time algorithm when applied to their cube. Later, modifications of the Klee–Minty cube have shown poor behavior both for other basis-exchange pivoting algorithms and also for interior-point algorithms.".
- Q6420102 thumbnail Unitcube.svg?width=300.
- Q6420102 wikiPageExternalLink Klee-Minty.pdf.
- Q6420102 wikiPageExternalLink translate?sl=auto&tl=en&js=n&prev=_t&hl=en&ie=UTF-8&layout=2&eotf=1&u=http%3A%2F%2Fwww.mathematik.de%2Fger%2Finformation%2Fforschungsprojekte%2Fzieglergeometrie%2Fzieglergeometrie.html.
- Q6420102 wikiPageExternalLink mp2008.pdf.
- Q6420102 wikiPageExternalLink crisscross.ps.
- Q6420102 wikiPageExternalLink Nematollahi:Eissa.html.
- Q6420102 wikiPageExternalLink zieglergeometrie.html.
- Q6420102 wikiPageWikiLink Q11205.
- Q6420102 wikiPageWikiLink Q134164.
- Q6420102 wikiPageWikiLink Q1473607.
- Q6420102 wikiPageWikiLink Q16667694.
- Q6420102 wikiPageWikiLink Q17006040.
- Q6420102 wikiPageWikiLink Q200125.
- Q6420102 wikiPageWikiLink Q202843.
- Q6420102 wikiPageWikiLink Q2072112.
- Q6420102 wikiPageWikiLink Q2246305.
- Q6420102 wikiPageWikiLink Q2393193.
- Q6420102 wikiPageWikiLink Q2658.
- Q6420102 wikiPageWikiLink Q269878.
- Q6420102 wikiPageWikiLink Q333464.
- Q6420102 wikiPageWikiLink Q337040.
- Q6420102 wikiPageWikiLink Q378574.
- Q6420102 wikiPageWikiLink Q43260.
- Q6420102 wikiPageWikiLink Q461992.
- Q6420102 wikiPageWikiLink Q470505.
- Q6420102 wikiPageWikiLink Q4828244.
- Q6420102 wikiPageWikiLink Q4924975.
- Q6420102 wikiPageWikiLink Q504353.
- Q6420102 wikiPageWikiLink Q50695.
- Q6420102 wikiPageWikiLink Q6426361.
- Q6420102 wikiPageWikiLink Q7016313.
- Q6420102 wikiPageWikiLink Q7214708.
- Q6420102 wikiPageWikiLink Q72382.
- Q6420102 wikiPageWikiLink Q7451559.
- Q6420102 wikiPageWikiLink Q7463500.
- Q6420102 wikiPageWikiLink Q8037118.
- Q6420102 wikiPageWikiLink Q8250013.
- Q6420102 wikiPageWikiLink Q8366.
- Q6420102 wikiPageWikiLink Q898572.
- Q6420102 wikiPageWikiLink Q929302.
- Q6420102 wikiPageWikiLink Q997962.
- Q6420102 comment "The Klee–Minty cube (named after Victor Klee and George J. Minty) is a unit cube whose corners have been slightly perturbed. Klee and Minty demonstrated that Dantzig's simplex algorithm has poor worst-case performance when initialized at one corner of their "squashed cube".In particular, many optimization algorithms for linear optimization exhibit poor performance when applied to the Klee–Minty cube.".
- Q6420102 label "Klee–Minty cube".
- Q6420102 depiction Unitcube.svg.