Jump to content

Talk:Activity selection problem

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 15:38, 22 January 2024 (Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Mathematics}}, {{WikiProject Computing}}.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Dupe?

[edit]

is this a dupe of Assignment problem? I'm too tired to tell right now Spencerk (talk) 22:15, 28 August 2014 (UTC)[reply]

Seems to be at least extremely similar; this seems to present the problem as maximizing number of tasks given fixed total time, whereas the other seem to present it as minimizing total "cost" given a fixed list of tasks, but that seems a fairly narrow distinction. Not my field, though... Bryanrutherford0 (talk) 01:55, 24 September 2014 (UTC)[reply]

Too cryptic

[edit]

For someone who understands the language of the symbols, it might make sense, but for anyone else it's hopeless. Just exactly what kind of notation is this? A reference to a primer on set notation would be helpful, if it is set notation.