Jump to content

Talk:Discrete optimization

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 22:30, 31 January 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 2 deprecated parameters: field, historical.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This is a stub, please add more to it.VPL Strathcona (talk) 21:49, 31 March 2019 (UTC)[reply]

Is all discrete optimization combinatorial?

[edit]

The Wikipedia definition of combinatorial optimization seems to imply that all discrete problems are combinatorial. To reconcile these, should the text be changed here or there? LachlanA (talk) 02:54, 15 November 2023 (UTC)[reply]

Well, vice versa. "Discrete" refers to solution set. "Combinatorial" refers to the nature of methods used. There is no particular logic in naming, just tradition. - Altenmann >talk 04:44, 15 November 2023 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Discrete_optimization&oldid=1201556911"