operations_research::Source Namespace Reference

Classes
struct	FlowArc

Detailed Description

Solve matching model using a min-cost flow. Here is the underlyihg flow: | (1,0) | (N,0) V V (vehicles) unperformed | (1,cost) | V | (nodes/pickup/deliveries) | (1,penalty) | (1,0) | V | disjunction <------— | (1, 0) V Sink

On arcs, (,) represents (capacity, cost). N: number of disjunctions