A matheuristic approach to large-scale avionic scheduling von Karlsson, Emil, Rönnberg, Elina, Stenberg, Andreas, Uppman, Hannes

Volltext

The Complexity of Boolean Surjective General-Valued CSPs von Fulla, Peter, Uppman, Hannes, Živný, Stanislav

Volltext

The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems von Jonsson, Peter, Lagerkvist, Victor, Schmidt, Johannes, Uppman, Hannes

Volltext

The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom von Uppman, Hannes

Volltext

Max-Sur-CSP on Two Elements von Uppman, Hannes

Volltext

On Some Combinatorial Optimization Problems: Algorithms and Complexity von Uppman, Hannes

Volltext bestellen

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis von Jonsson, Peter, Lagerkvist, Victor, Schmidt, Johannes, Uppman, Hannes

Volltext

Computational Complexity of the Minimum Cost Homomorphism Problem on Three-Element Domains von Uppman, Hannes

Volltext bestellen

Three-Element Min-Sol and Conservative Min-Cost-Hom von Uppman, Hannes

Volltext bestellen

The complexity of Boolean surjective general-valued CSPs von Fulla, Peter, Uppman, Hannes, Zivny, Stanislav

Volltext

Computational Complexity of the Minimum Cost Homomorphism Problem on Three-Element Domains von Uppman, Hannes

Volltext

Three-Element Min-Sol and Conservative Min-Cost-Hom von Uppman, Hannes

Volltext

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis von Jonsson, Peter, Lagerkvist, Victor, Schmidt, Johannes, Uppman, Hannes

Volltext bestellen

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis von Jonsson, Peter, Lagerkvist, Victor, Schmidt, Johannes, Uppman, Hannes

Volltext

The Reflection Principle for One-dimensional Quasiminimizers von Uppman Hannes 1983- , Linköpings universitet, Matematiska institutionen

Volltext bestellen