New perspectives on multi-objective Knapsack problems / vorgelegt von Britta Schulze. Wuppertal, Januar 2017
Content
- Introduction
- Preliminaries
- Computation of extreme supported points
- Definitions
- (mo.0c), weight space, zonotopes, and arrangements of hyperplanes
- Efficient computation of extreme supported solutions of (mo.0c)
- Efficient computation of extreme supported points of (mo.1c)
- Conclusion and further ideas
- Bi-dimensional knapsack problems with a soft constraint
- Reformulating constraints as objectives
- Dynamic programming algorithm
- Preprocessing and pruning strategies
- Dynamic programming with cuts
- Computational results
- Multi-dimensional knapsack problems with soft constraints
- Conclusion and further ideas
- Rectangular knapsack problems and representative solutions
- Quadratic knapsack problems
- Cardinality constrained rectangular knapsack problems
- Approximation algorithms
- Computational results
- Hypervolume maximizing representations
- Conclusion and further ideas
- Conclusion
- Bibliography