Wikipedia:Articles for deletion/Ordinal optimization


 * The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review).  No further edits should be made to this page.

The result was speedy close. The AFD notice was never added to the article, and the nominator created the per-article AFD discussion page only to then rescue the article xyrself. &#9786; Uncle G (talk) 00:08, 18 November 2010 (UTC)

Ordinal optimization
AfDs for this article: 
 * – ( View AfD View log  •  )


 * There are many problems with this stub. The name is appropriate for a broad article on combinatorial optimization on partially ordered sets or semilattices. The existing stub describes only some engineering professor's heuristic, giving a vague account that does not even claim notability and does not distinguish the content from numerous approaches to similar problems (e.g., Olkin, Gibbons, et alia on Selecting and Ordering Populations, etc.) Thanks. Sincerely, Kiefer.Wolfowitz (talk) 18:34, 16 November 2010 (UTC)


 * WITHDRAW NOMINATION: I tried to save the article by adding context, a lead, references to reliable sources, etc. Kiefer.Wolfowitz (talk) 22:12, 16 November 2010 (UTC)
 * The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.