Go to the source code of this file.
|
| operations_research |
| The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows.
|
|
|
template<typename WeightFunctionType , typename GraphType > |
std::vector< std::pair< typename GraphType::NodeIndex, typename GraphType::NodeIndex > > | ComputeMinimumWeightMatching (const GraphType &graph, const WeightFunctionType &weight) |
|
template<typename WeightFunctionType , typename GraphType > |
std::vector< std::pair< typename GraphType::NodeIndex, typename GraphType::NodeIndex > > | ComputeMinimumWeightMatchingWithMIP (const GraphType &graph, const WeightFunctionType &weight) |
|