Metraipolis › archive › dc_675706c06dbc
Activity selection problem — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Activity_selection_problem
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-07T12:02:25.993Z
- SHA-256 of the archived text
955859d0addf90f49ba034407f958fb5ff573b7a419810a2ec533ccf4fa9d4b0- Stable URL of this page
https://metraipolis.com/documento/dc_675706c06dbc
How to cite
Activity selection problem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Activity_selection_problem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_675706c06dbc (Metraipolis archive dc_675706c06dbc, sha256 955859d0addf90f49ba034407f958fb5ff573b7a419810a2ec533ccf4fa9d4b0)
BibTeX
@misc{dc675706c06dbc,
title = {Activity selection problem — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Activity_selection_problem},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_675706c06dbc; sha256 955859d0addf90f49ba034407f958fb5ff573b7a419810a2ec533ccf4fa9d4b0},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Activity_selection_problem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 maximization problem (ISMP), which is a special type of the more general Interval Scheduling problem. 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. Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico). Fonte: Wikipedia in inglese, voce «Activity selection problem» — https://en.wikipedia.org/wiki/Activity_selection_problem Wikidata Q10859675: «combinatorial optimization problem» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q10859675 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Activity_selection_problem?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1302530372, consultata il 2026-11-07T11:56:26.881Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 01218cb7a13512d20838080b2cf1c950ccd8c45ff922ed6b548df8629f3b2d7f