• Publications
  • Influence
The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom
TLDR
We study the complexity of two VCSPs for constraint languages that are not finite-valued, namely Min-Cost-Hom and Min-Sol. Expand
  • 22
  • 4
  • PDF
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains
TLDR
We study the computational complexity of the extended minimum cost homomorphism problem (Min-Cost-Hom) as a function of a constraint language, i.e. a set of constraint relations and cost functions that are allowed to appear in instances. Expand
  • 13
  • 3
  • PDF
Max-Sur-CSP on Two Elements
TLDR
We study Max-Sur-CSP on the two-element domain and determine the computational complexity for all constraint languages (families of allowed constraints). Expand
  • 3
  • 1
The Reflection Principle for One-dimensional Quasiminimizers
In this paper the reflection-extension of one-dimensional quasiminimizers is studied.A brief introduction to quasiminimizers, focused on the one-dimensional ones, is given.The main result of theExpand
  • 6
  • 1
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
TLDR
We show that such languages also exist for the max ones problem (Max-Ones(Γ)) and the Boolean valued constraint satisfaction problem over finite-valued constraint languages. Expand
  • 4
  • PDF
A matheuristic approach to large-scale avionic scheduling
TLDR
This paper considers scheduling of an integrated modular avionic system which from a more general perspective can be seen as a multiprocessor scheduling problem that includes a communication network. Expand
  • 1
On Some Combinatorial Optimization Problems : Algorithms and Complexity
This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a ...
  • 1
  • PDF
The Complexity of Boolean Surjective General-Valued CSPs
TLDR
Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with a (Q ∪ {∞ })-valued objective function given as a sum of fixed-arity functions. Expand
  • 1
  • PDF
Heuristic enhancements of a constraint generation procedure for scheduling of avionic systems
Heuristic enhancements of a constraint generation procedure for scheduling of avionic systems
Computational Complexity of the Minimum Cost Homomorphism Problem on Three-Element Domains
TLDR
We study the computational complexity of the (extended) minimum cost homomorphism problem (Min-Cost-Hom) as a function of a constraint language, i.e. a set of constraint relations and cost functions that appear in instances. Expand