SETH-based Lower Bounds for Subset Sum and Bicriteria Path.
Amir AbboudKarl BringmannDanny HermelinDvir ShabtayPublished in: ACM Trans. Algorithms (2022)
Keyphrases
- bicriteria
- lower bound
- shortest path problem
- efficient solutions
- completion times
- objective function
- shortest path
- integer linear programming
- upper bound
- knapsack problem
- min sum
- flowshop
- branch and bound
- optimal solution
- branch and bound algorithm
- lower and upper bounds
- np hard
- cutting plane
- scheduling problem
- single machine scheduling problem
- weighted sum
- combinatorial optimization problems
- linear programming
- worst case
- single machine
- manufacturing cell
- neural network
- multiple objectives
- optimization problems
- lagrangian relaxation
- evolutionary algorithm
- steady state