Contact Center Scheduling with Strict Resource Requirements (Q3009760): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combining integer programming and the randomization method to schedule employees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Non-monotone submodular maximization under matroid and knapsack constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A PCP characterization of NP with optimal amortized query complexity / rank | |||
Normal rank | |||
Latest revision as of 05:43, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Contact Center Scheduling with Strict Resource Requirements |
scientific article |
Statements
Contact Center Scheduling with Strict Resource Requirements (English)
0 references
24 June 2011
0 references
0 references
