de
en
Close
Detailsuche
Bibliotheken
Projekt
Imprint
Privacy Policy
de
en
Close
Imprint
Privacy Policy
jump to main content
Search Details
Quicksearch:
OK
Result-List
Title
Title
Content
Content
Page
Page
Search the document
On improvements of multi-objective branch and bound / vorgelegt von Julius C. Bauß. Wuppertal, Februar 2024
Content
Contents
Introduction
Outline of this Thesis
Publications
Multi-objective Optimization Models and Properties
Multi-objective Optimization Models
Optimality Conditions
Bound Sets
Polyhedral Theory
Solution Methods
Objective Space Methods
-constraint Method
Weighted Sum Method
Augmented Weighted Tchebycheff Method
Search Region Splitting Methods
Two-phase Methods
Decision Space Methods
Multi-objective Dynamic Programming
Multi-objective Branch and Bound
Augmenting Bi-objective Branch and Bound by Scalarization-Based Information
A New Bi-objective Branching Strategy
Augmenting Bi-objective Branch and Bound by Solving IP Scalarizations
Using Weighted Sum Scalarizations
Using Augmented Weighted Tchebycheff Scalarizations
Algorithmic Control of IP Scalarizations
Numerical Tests
Bi-objective Multidimensional Knapsack Problems
Bi-objective Assignment Problems
Bi-objective Discrete Uncapacitated Facility Location Problems
Summary
Adaptive Improvements of Multi-objective Branch and Bound
A New Multi-objective Node Selection Strategy
Solving IP Scalarizations to Improve the Upper and Lower Bound Set
Warmstarting the Bound Sets
Improving the Upper Bound Set by -constraint Scalarizations
Using Simple Lower Bound Sets
Algorithmic Control of the Presented Approaches
Numerical Tests
Branching and Queuing for Multi-objective Branch and Bound
Sequencing of Subproblems
Multi-objective Branching Rules
Multi-objective Node Selection Strategies
Numerical Tests
Conclusion
Nomenclature
Bibliography