Computing solution space properties of combinatorial optimization problems via generic tensor networks
We introduce a unified framework to compute the solution space properties of a broad class
of combinatorial optimization problems. These properties include finding one of the optimum …
of combinatorial optimization problems. These properties include finding one of the optimum …
Experimental research and algorithmic improvements involving the graph parameter boolean-width
FJP van Houten - 2015 - studenttheses.uu.nl
In this thesis, we investigate numerous algorithms that make use of boolean
decompositions. We provide a new algorithm for computing the representatives of linear …
decompositions. We provide a new algorithm for computing the representatives of linear …
Practical algorithms for linear boolean-width
CB Ten Brinke, FJP Van Houten, HL Bodlaender - arXiv, 2015 - research.tue.nl
In this paper, we give a number of new exact algorithms and heuristics to compute linear
boolean decompositions, and experimentally evaluate these algorithms. The experimental …
boolean decompositions, and experimentally evaluate these algorithms. The experimental …
Variations on boolean-width
CB ten Brinke - 2015 - studenttheses.uu.nl
This thesis is about the graph parameter boolean-width and several related parameters. In
particular we investigate the restriction of boolean-width to linear decompositions, called …
particular we investigate the restriction of boolean-width to linear decompositions, called …
Practical Algorithms for Linear Boolean-width
CBT Brinke, FJP van Houten… - arXiv preprint arXiv …, 2015 - arxiv.org
In this paper, we give a number of new exact algorithms and heuristics to compute linear
boolean decompositions, and experimentally evaluate these algorithms. The experimental …
boolean decompositions, and experimentally evaluate these algorithms. The experimental …