payload: {"ref":null,"ref_type":"repository","master_branch":"master","description":"The covering salesman problem (CSP) is a generalization of the TSP in which we have to satisfy all the customers’ demand by visiting or covering them. Essentially, for each customer, say i, it is given a covering radius (d i), within that all the located customers will be covered. The goal of the CSP is to construct a minimum lengthtour over a subset of the given customers such that each customer,not visited on the tour, is within the covering distance of at least oneThe covering salesman problem (CSP) is a generalization of theTSP in which we have to satisfy all the customers’ demand by visit-ing or covering them [11]. Essentially, for each customer, say i, it isgiven a covering radius di, within that all the located customers willbe covered. The goal of the CSP is to construct a minimum lengthtour over a subset of the given customers such that each customer,not visited on the tour, is within the covering distance of at least oneThe covering salesman problem (CSP) is a generalization of theTSP in which we have to satisfy all the customers’ demand by visit-ing or covering them [11]. Essentially, for each customer, say i, it isgiven a covering radius di, within that all the located customers willbe covered. The goal of the CSP is to construct a minimum lengthtour over a subset of the given customers such that each customer,not visited on the tour, is within the covering distance of at least one. The covering salesman problem (CSP) is a generalization of the TSP in which we have to satisfy all the customers’ demand by visiting or covering them . Essentially, for each customer, say i, it is given a covering radius distance, within that all the located customers will be covered. The goal of the CSP is to construct a minimum length tour over a subset of the given customers such that each customer,not visited on the tour, is within the covering distance of at least one visiting customer.","pusher_type":"user"}
other: {"actor":{"display_login":"25PRASHANT"}}