Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization.
Vaibhav SrivastavaFrancesco BulloPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- optimization problems
- special case
- combinatorial optimization problems
- optimal solution
- minimum cost
- worst case
- test problems
- vertex cover
- open shop
- set cover
- production planning
- network design problem
- dynamic programming
- scheduling problem
- primal dual
- randomized algorithms
- quadratic program
- lower bound
- combinatorial optimization
- evolutionary algorithm
- cutting plane
- integer programming
- greedy heuristic
- approximation ratio
- constant factor
- nsga ii
- branch and bound algorithm
- optimization algorithm
- computational complexity
- precedence constraints
- neural network
- convergence rate
- greedy algorithms
- linear program
- multistage
- metaheuristic
- polynomial time approximation
- linear programming
- disjoint paths