Pages that link to "Item:Q3189021"
From MaRDI portal
The following pages link to The optimality of the online greedy algorithm in carpool and chairman assignment problems (Q3189021):
Displayed 8 items.
- An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101) (← links)
- Error diffusion on acute simplices: invariant tiles (Q1678651) (← links)
- Error diffusion on simplices: the structure of bounded invariant tiles (Q1749010) (← links)
- Webster sequences, apportionment problems, and just-in-time sequencing (Q2243136) (← links)
- The Offline Carpool Problem Revisited (Q2946418) (← links)
- Bounding the errors for convex dynamics on one or more polytopes (Q3636596) (← links)
- Whose Turn Is It to Drive Today? (Q4961359) (← links)
- Almost Beatty Partitions (Q5226858) (← links)