Capicitated Vehicle Routing Problem (a twist of traveling salesman problem)
Given a list of gifts, weights, and their locations, deliver them in sleighs with a weight limit
All sleighs start from north pole, then head to each gift in the order that a user gives, and then head back to north pole
Sleighs have a base weight
"Weighted distance" = distance traveled * weights carried for that segment
Goal: minimize the total weighted distance traveled
This model uses R to separate the problem to small instances, where the exact MIP formulation
small enough to be solved quickly, then assembles the results to a single submission.