Talk:Criss-cross algorithm: Revision history

13 February 2024

• curprev 06:3806:38, 13 February 2024 Cewbot talk contribs m 6,246 bytes −16 Maintain {{WPBS}}: 3 WikiProject templates. Keep majority rating "C" in {{WPBS}}. Remove 3 same ratings as {{WPBS}} in {{WikiProject Mathematics}}, {{WikiProject Computer science}}, {{WikiProject Systems}}. undo Tag: Talk banner shell conversion

14 January 2024

• curprev 03:0803:08, 14 January 2024 Harryboyles talk contribs m 6,262 bytes −18 →top: removing unknown parameters in {{WikiProject Computer science}} undo Tag: AWB

20 May 2022

• curprev 04:4104:41, 20 May 2022 MalnadachBot talk contribs m 6,280 bytes 0 Fixed Lint errors. (Task 12) undo Tag: AWB

10 March 2022

• curprev 17:3617:36, 10 March 2022 MalnadachBot talk contribs m 6,280 bytes 0 Fixed Lint errors. (Task 12) undo Tag: AWB

23 July 2013

• curprev 03:4503:45, 23 July 2013 BattyBot talk contribs m 6,280 bytes +32 Talk page general fixes & other cleanup using AWB (9359) undo

30 August 2011

• curprev 22:3522:35, 30 August 2011 Kiefer.Wolfowitz talk contribs 6,248 bytes +368 →Example or Illustration needed: new section undo
• curprev 22:3322:33, 30 August 2011 Kiefer.Wolfowitz talk contribs 5,880 bytes −16 C class from Start undo

6 April 2011

• curprev 00:2900:29, 6 April 2011 Kiefer.Wolfowitz talk contribs 5,896 bytes +320 →New hook: Accessible undo

5 April 2011

• curprev 08:0108:01, 5 April 2011 DYKUpdateBot talk contribs 5,576 bytes +338 Article appeared on DYK on 5 April 2011, adding {{dyktalk}} undo

29 March 2011

• curprev 17:5817:58, 29 March 2011 Kiefer.Wolfowitz talk contribs m 5,238 bytes +72 →New hook: Accessible: link undo
• curprev 17:5717:57, 29 March 2011 Kiefer.Wolfowitz talk contribs m 5,166 bytes +19 →Did You Know?: update undo

24 March 2011

• curprev 21:4421:44, 24 March 2011 Kiefer.Wolfowitz talk contribs 5,147 bytes +36 →Old nomination: Inaccessible undo

23 March 2011

• curprev 01:3101:31, 23 March 2011 Kiefer.Wolfowitz talk contribs 5,111 bytes −36 downgrade importance to low undo
• curprev 00:4000:40, 23 March 2011 Kiefer.Wolfowitz talk contribs 5,147 bytes +598 →Did You Know?: submitted it, along with a graphic. Please consider vetting it at DYK. Thanks again for your feedback. undo

22 March 2011

• curprev 23:2523:25, 22 March 2011 CRGreathouse talk contribs 4,549 bytes +174 →Did You Know? undo
• curprev 21:0621:06, 22 March 2011 Kiefer.Wolfowitz talk contribs 4,375 bytes +330 →Did You Know?: I nominated the alternative. Thanks for the suggestions. undo
• curprev 20:2520:25, 22 March 2011 Kiefer.Wolfowitz talk contribs 4,045 bytes +717 →Did You Know?: added some preliminary referencing. The expected behavior of the simplex method (on problems from the unit sphere) is O(D) by Borgwardt and Smale. I don't have Klee & Minty's paper handy, but it seems trivial that a cube drawn fro undo
• curprev 20:0520:05, 22 March 2011 Kiefer.Wolfowitz talk contribs 3,328 bytes −80 →Did You Know?: ce undo
• curprev 20:0420:04, 22 March 2011 Kiefer.Wolfowitz talk contribs 3,408 bytes +697 →Did You Know?: that the '''criss-cross algorithm''' and the simplex algorithm can visit all 2^''D'' corners of a <!-- the Klee–Minty --> cube in dimension ' undo
• curprev 20:0020:00, 22 March 2011 Kiefer.Wolfowitz talk contribs m 2,711 bytes +14 →Did You Know?: link cube undo
• curprev 19:5919:59, 22 March 2011 Kiefer.Wolfowitz talk contribs 2,697 bytes +390 →Did You Know?: I simplified it a bit. I shall try to quickly find a reference to the expected behavior of the algorithms. undo
• curprev 19:5419:54, 22 March 2011 Kiefer.Wolfowitz talk contribs 2,307 bytes +437 →Did You Know?: the phrase "Klee-Minty" should go undo
• curprev 19:5019:50, 22 March 2011 CRGreathouse talk contribs 1,870 bytes +567 →Did You Know?: ideas undo
• curprev 04:2504:25, 22 March 2011 CRGreathouse talk contribs 1,303 bytes +278 →Did You Know? undo
• curprev 03:3703:37, 22 March 2011 Kiefer.Wolfowitz talk contribs 1,025 bytes +118 →DYK: I nominated the following hook: undo
• curprev 03:0603:06, 22 March 2011 Kiefer.Wolfowitz talk contribs 907 bytes +27 →DYK: that the '''criss-cross algorithm''' and the simplex algorithm are not polynomial-time algorithms <!-- for linear optimization --> because they visit all 2^''D'' corners of t undo
• curprev 03:0503:05, 22 March 2011 Kiefer.Wolfowitz talk contribs 880 bytes +45 →DYK: the '''criss-cross algorithm''' and the simplex algorithm are not polynomial-time algorithms for linear-optimization because they visit all 2^''D'' corners of the Klee-Minty undo
• curprev 03:0203:02, 22 March 2011 Kiefer.Wolfowitz talk contribs 835 bytes +194 →DYK: the '''criss-cross algorithm''' and the simplex algorithm are not polynomial-time algorithms for linear-optimization because they visit all 2^''D'' corners of the Klee-Minty cube in dimensio undo
• curprev 02:0002:00, 22 March 2011 Kiefer.Wolfowitz talk contribs 641 bytes +3 upgrade to start class (from stub) undo
• curprev 00:5700:57, 22 March 2011 Kiefer.Wolfowitz talk contribs 638 bytes +394 DYK undo

21 March 2011

• curprev 23:5223:52, 21 March 2011 Kiefer.Wolfowitz talk contribs 244 bytes −965 →Fiat CCA: remove since I created article undo
• curprev 21:5021:50, 21 March 2011 Kiefer.Wolfowitz talk contribs 1,209 bytes +259 Create undo
• curprev 21:4621:46, 21 March 2011 Kiefer.Wolfowitz talk contribs 950 bytes +950 {{cite journal|first1=Komei|last1=Fukuda|authorlink1=Komei Fukuda|first2=Tamás|last2=Terlaky|authorlink2=Tamás Terlaky|title=Criss-cross methods: A fresh view on pivot algorithms |url=http://www.cas.mcmaster.ca/~terlaky/files/crisscross.ps|journal=