4 papers · 1 filter
The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride
Ananya Christman, Christine Chung, Nicholas Jaczko +3
In the Online-Dial-a-Ride Problem (OLDARP) a server travels through a metric space to serve requests for rides. We consider a variant where each request specifies a source, destina…
Bin Packing with Multiple Colors
Hamza Alsarhan, Davin Chia, Ananya Christman +2
In the Colored Bin Packing problem a set of items with varying weights and colors must be packed into bins of uniform weight limit such that no two items of the same color may be p…
Colored Bin Packing
Hamza Alsarhan, Davin Chia, Ananya Christman +2
We study the Colored Bin Packing Problem: we are given a set of items where each item has a weight and color. We must pack the items in bins of uniform capacity such that no two it…
Maximizing Revenues for Online-Dial-a-Ride
Ananya Christman, William Forcier
In the classic Dial-a-Ride Problem, a server travels in some metric space to serve requests for rides. Each request has a source, destination, and release time. We study a variatio…