11 citations · 14 across the 13 of their papers we have counts for
1 paper · 2 filters
Arindam Pal
Routing and scheduling problems are fundamental problems in combinatorial optimization, and also have many applications. Most variations of these problems are NP-Hard, so we need t…