Approximating the 3-period Incremental Knapsack Problem.
Federico Della CroceUlrich PferschyRosario ScatamacchiaPublished in: J. Discrete Algorithms (2018)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- optimization problems
- dynamic programming
- test problems
- np hard
- exact algorithms
- bicriteria
- multiple objectives
- multidimensional knapsack problem
- heuristic solution
- production planning
- np hard problems
- continuous relaxation
- greedy algorithm
- implicit enumeration
- cutting plane
- decision variables
- linear programming relaxation
- vehicle routing problem
- metaheuristic