Combinatorial Optimization Problems with Conflicts or Vectors KU Leuven
In this thesis titled, combinatorial optimization problem with conflicts or vectors, we introduce three combinatorial optimization problems and investigate to what extent these problems can still be solved in polynomial time or approximated.
First, we look at Balanced Optimization with vector costs. An instance of a balanced optimization problem with vector costs consists of a ground set X, a cost vector for every element of X, ...