O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities.

Mong-Jen Kao Hai-Lun Tu D. T. Lee

Published in: Algorithmica (2019)

Keyphrases

bicriteria
capacity constraints
efficient solutions
integer linear programming
knapsack problem
location problems
np hard
shortest path problem
lot sizing
upper approximation
routing problem
approximation algorithms
neural network
flowshop
vehicle routing problem
search algorithm
optimal solution