The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arising in Snow Removal Routing.
Per Olov LindbergGholamreza RazmaraPublished in: OR (2004)
Keyphrases
- np hard
- prize collecting
- travel time
- maximum weight
- scheduling problem
- routing problem
- special case
- np complete
- optimal solution
- lower bound
- linear programming
- shortest path
- integer programming
- approximation algorithms
- worst case
- routing protocol
- computational complexity
- routing algorithm
- ad hoc networks
- vehicle routing problem
- knapsack problem
- branch and bound algorithm
- road network
- linear program
- connected components
- single machine scheduling problem
- graph mining
- query processing
- feasible solution
- constraint satisfaction problems
- genetic algorithm