SETH-Based Lower Bounds for Subset Sum and Bicriteria Path.
Amir AbboudKarl BringmannDanny HermelinDvir ShabtayPublished in: CoRR (2017)
Keyphrases
- bicriteria
- lower bound
- shortest path problem
- efficient solutions
- objective function
- completion times
- upper bound
- shortest path
- min sum
- integer linear programming
- knapsack problem
- optimal solution
- branch and bound
- flowshop
- branch and bound algorithm
- np hard
- lower and upper bounds
- weighted sum
- worst case
- scheduling problem
- combinatorial optimization problems
- multiple objectives
- markov chain
- manufacturing cell