Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Klee–Minty_cube> ?p ?o }
Showing triples 1 to 86 of
86
with 100 triples per page.
- Klee–Minty_cube 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.".
- Klee–Minty_cube thumbnail Unitcube.svg?width=300.
- Klee–Minty_cube wikiPageExternalLink Klee-Minty.pdf.
- Klee–Minty_cube 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.
- Klee–Minty_cube wikiPageExternalLink mp2008.pdf.
- Klee–Minty_cube wikiPageExternalLink crisscross.ps.
- Klee–Minty_cube wikiPageExternalLink Nematollahi:Eissa.html.
- Klee–Minty_cube wikiPageExternalLink zieglergeometrie.html.
- Klee–Minty_cube wikiPageID "31302509".
- Klee–Minty_cube wikiPageLength "13516".
- Klee–Minty_cube wikiPageOutDegree "50".
- Klee–Minty_cube wikiPageRevisionID "683686763".
- Klee–Minty_cube wikiPageWikiLink Algorithm.
- Klee–Minty_cube wikiPageWikiLink Analysis_of_algorithms.
- Klee–Minty_cube wikiPageWikiLink Arithmetic.
- Klee–Minty_cube wikiPageWikiLink Arithmetic_operation.
- Klee–Minty_cube wikiPageWikiLink Average-case_complexity.
- Klee–Minty_cube wikiPageWikiLink Big_O_notation.
- Klee–Minty_cube wikiPageWikiLink Big_Oh.
- Klee–Minty_cube wikiPageWikiLink Big_oh.
- Klee–Minty_cube wikiPageWikiLink Blands_rule.
- Klee–Minty_cube wikiPageWikiLink Buchbergers_algorithm.
- Klee–Minty_cube wikiPageWikiLink Category:Analysis_of_algorithms.
- Klee–Minty_cube wikiPageWikiLink Category:Computational_complexity_theory.
- Klee–Minty_cube wikiPageWikiLink Category:Convex_geometry.
- Klee–Minty_cube wikiPageWikiLink Category:Cubes.
- Klee–Minty_cube wikiPageWikiLink Category:Linear_programming.
- Klee–Minty_cube wikiPageWikiLink Category:Mathematical_optimization.
- Klee–Minty_cube wikiPageWikiLink Central_path.
- Klee–Minty_cube wikiPageWikiLink Criss-cross_algorithm.
- Klee–Minty_cube wikiPageWikiLink Cubic_function.
- Klee–Minty_cube wikiPageWikiLink Cubic_polynomial.
- Klee–Minty_cube wikiPageWikiLink Degree_of_a_polynomial.
- Klee–Minty_cube wikiPageWikiLink Dimension_(vector_space).
- Klee–Minty_cube wikiPageWikiLink Ellipsoid_method.
- Klee–Minty_cube wikiPageWikiLink Ellipsoidal_method.
- Klee–Minty_cube wikiPageWikiLink Exchange_algorithm.
- Klee–Minty_cube wikiPageWikiLink Expected_value.
- Klee–Minty_cube wikiPageWikiLink Gaussian_elimination.
- Klee–Minty_cube wikiPageWikiLink George_Dantzig.
- Klee–Minty_cube wikiPageWikiLink George_J._Minty.
- Klee–Minty_cube wikiPageWikiLink Greedy_algorithm.
- Klee–Minty_cube wikiPageWikiLink Günter_M._Ziegler.
- Klee–Minty_cube wikiPageWikiLink Günter_Ziegler.
- Klee–Minty_cube wikiPageWikiLink Interior-point_method.
- Klee–Minty_cube wikiPageWikiLink Interior_point_method.
- Klee–Minty_cube wikiPageWikiLink Karmarkars_algorithm.
- Klee–Minty_cube wikiPageWikiLink Linear_optimization.
- Klee–Minty_cube wikiPageWikiLink Linear_programming.
- Klee–Minty_cube wikiPageWikiLink Matroid.
- Klee–Minty_cube wikiPageWikiLink Multivariate_polynomial.
- Klee–Minty_cube wikiPageWikiLink Polynomial.
- Klee–Minty_cube wikiPageWikiLink Polynomial-time_algorithm.
- Klee–Minty_cube wikiPageWikiLink Quadratic_function.
- Klee–Minty_cube wikiPageWikiLink Quadratic_polynomial.
- Klee–Minty_cube wikiPageWikiLink Simplex_algorithm.
- Klee–Minty_cube wikiPageWikiLink Time_complexity.
- Klee–Minty_cube wikiPageWikiLink Unit_cube.
- Klee–Minty_cube wikiPageWikiLink Victor_Klee.
- Klee–Minty_cube wikiPageWikiLink Worst-case_complexity.
- Klee–Minty_cube wikiPageWikiLink File:Simplex_description.png.
- Klee–Minty_cube wikiPageWikiLink File:Unitcube.svg.
- Klee–Minty_cube wikiPageWikiLinkText "Klee–Minty cube".
- Klee–Minty_cube collapsed "yes".
- Klee–Minty_cube hasPhotoCollection Klee–Minty_cube.
- Klee–Minty_cube state "collapsed".
- Klee–Minty_cube wikiPageUsesTemplate Template:Citation_needed.
- Klee–Minty_cube wikiPageUsesTemplate Template:Cite_book.
- Klee–Minty_cube wikiPageUsesTemplate Template:Cite_journal.
- Klee–Minty_cube wikiPageUsesTemplate Template:Expand_section.
- Klee–Minty_cube wikiPageUsesTemplate Template:Mathematical_programming.
- Klee–Minty_cube wikiPageUsesTemplate Template:Optimization_algorithms.
- Klee–Minty_cube subject Category:Analysis_of_algorithms.
- Klee–Minty_cube subject Category:Computational_complexity_theory.
- Klee–Minty_cube subject Category:Convex_geometry.
- Klee–Minty_cube subject Category:Cubes.
- Klee–Minty_cube subject Category:Linear_programming.
- Klee–Minty_cube subject Category:Mathematical_optimization.
- Klee–Minty_cube 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.".
- Klee–Minty_cube label "Klee–Minty cube".
- Klee–Minty_cube sameAs m.0gj9y1p.
- Klee–Minty_cube sameAs Q6420102.
- Klee–Minty_cube sameAs Q6420102.
- Klee–Minty_cube wasDerivedFrom Klee–Minty_cube?oldid=683686763.
- Klee–Minty_cube depiction Unitcube.svg.
- Klee–Minty_cube isPrimaryTopicOf Klee–Minty_cube.