Activity selection problem
id:
activity-selection-problem-280-2011895
title:
Activity selection problem
text:
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. The activity selection problem is also known as the Interval scheduling max
brand slug:
wiki
category slug:
encyclopedia
description:
Combinatorial optimization problem
original url:
https://en.wikipedia.org/wiki/Activity_selection_problem
date created:
date modified:
2021-08-12T06:25:42Z
main entity:
{"identifier":"Q10859675","url":"https://www.wikidata.org/entity/Q10859675"}
image:
fields total:
13
integrity:
14