Salesforce Field Service Management

Problem Statement

Salesforce Field Service Management Problem Description Salesforce is improving its field service management system. A field service agent has to visit several client locations to complete service requests. The city's service map has connection_nodes junctions, numbered 0 to connection_nodes - 1 , and m roads. Road i joins junction connection_from[i] and junction connection_to[i] . It can be travelled in both directions , and travelling it in either direction takes connection_weight[i] units of time. The agent must: 1. start at the headquarters (HQ), which is junction 0 ; 2. visit all k client locations clients[0], ..., clients[k-1] (distinct junctions), in any order; 3. return to the headquarters (junction 0 ) after all visits are done. The agent may use any roads, pass through any junction any number of times, and a client location counts as visited the moment the agent reaches it. Find the minimum total travel time for the whole trip. If some client location cannot be reached from t