Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q10859675> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- Q10859675 subject Q8266681.
- Q10859675 subject Q8707181.
- Q10859675 abstract "The activity selection problem is a combinatorial optimization problem concerning the selection of non-conflicting activities to perform within a given time frame, given a set of activities each marked by a start time (si) and finish time (fi). The problem is to select the maximum number of activities that can be performed by a single person or machine, assuming that a person can only work on a single activity at a time.A classic application of this problem is in scheduling a room for multiple competing events, each having its own time requirements (start and end time), and many more arise within the framework of operations research.".
- Q10859675 wikiPageExternalLink actSelectionGreedy.htm.
- Q10859675 wikiPageWikiLink Q11019.
- Q10859675 wikiPageWikiLink Q11471.
- Q10859675 wikiPageWikiLink Q1333872.
- Q10859675 wikiPageWikiLink Q1751685.
- Q10859675 wikiPageWikiLink Q189224.
- Q10859675 wikiPageWikiLink Q194292.
- Q10859675 wikiPageWikiLink Q215382.
- Q10859675 wikiPageWikiLink Q380679.
- Q10859675 wikiPageWikiLink Q476300.
- Q10859675 wikiPageWikiLink Q504353.
- Q10859675 wikiPageWikiLink Q759676.
- Q10859675 wikiPageWikiLink Q8266681.
- Q10859675 wikiPageWikiLink Q8707181.
- Q10859675 wikiPageWikiLink Q984063.
- Q10859675 comment "The activity selection problem is a combinatorial optimization problem concerning the selection of non-conflicting activities to perform within a given time frame, given a set of activities each marked by a start time (si) and finish time (fi).".
- Q10859675 label "Activity selection problem".