Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint.
Bogdan ArmaseluOvidiu DaescuPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- maximum profit
- np hard
- knapsack problem
- minimum cost
- special case
- vertex cover
- facility location problem
- worst case
- constant factor
- primal dual
- approximation ratio
- randomized algorithms
- open shop
- network design problem
- undirected graph
- vehicle routing problem
- vehicle routing
- set cover
- approximation schemes
- disjoint paths
- linear constraints
- precedence constraints
- dynamic programming
- np hardness
- reinforcement learning
- polynomial time approximation
- integer programming
- optimal solution
- combinatorial auctions
- upper bound