Instance:
Loggi-n1001-k31 1
- Number of Customers (n):
1000
- Minimum Number of Vehicles (K):
31 2
- Capacity (Q):
180
- Tigh:
- Upper Bound (UB):
284356
- Benchmark:
DIMACS (2021) [D]
- Demand:
[0,10]
- Distance:
EXPLICIT
- Files:
1 Contributed by Loggi to DIMACS Challenge, from a real problem in the metropolitan area of Rio de Janeiro (Brazil)
2 not fixed: K is the minimum feasible number of vehicles