| Article ID: | iaor20103975 |
| Volume: | 2009 |
| Issue: | 1 |
| Start Page Number: | 55 |
| End Page Number: | 136 |
| Publication Date: | Sep 2009 |
| Journal: | Proceedings of the 10th Symposium on OR (Slovenia) (SOR '09) |
| Keywords: | optimization, scheduling |
Waste collection in Maribor; convex and positive noncommutative polynomilas; multi-armed bandit problems; hypergraphs and satisfiability; orbit construction; the resource-constrained project scheduling problem; graph partitioning; canister filling problem.