Ein genetischer Algorithmus für das beschränkte zweidimensionale Knapsack-Problem ohne Guillotineschnitt-Bedingung.
Andreas BortfeldtTobias WinterPublished in: Intelligente Systeme zur Entscheidungsunterstützung (2008)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- optimization problems
- dynamic programming
- exact algorithms
- production planning
- test problems
- multidimensional knapsack problem
- np hard
- np hard problems
- bicriteria
- greedy algorithm
- greedy heuristic
- multiple objectives
- implicit enumeration
- linear programming relaxation
- maximum profit
- continuous relaxation
- vehicle routing problem
- cutting plane
- heuristic solution
- worst case
- cost function
- lower bound