3 citations · 8 across the 4 of their papers we have counts for
5 papers
On vertex coloring without monochromatic triangles
Michał Karpiński, Krzysztof Piecuch
We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. W…
Encoding Cardinality Constraints using Generalized Selection Networks
Michał Karpiński, Marek Piotrów
Boolean cardinality constraints state that at most (at least, or exactly) out of propositional literals can be true. We propose a new class of selection networks that can b…
Smaller Selection Networks for Cardinality Constraints Encoding
Michał Karpiński, Marek Piotrów
Selection comparator networks have been studied for many years. Recently, they have been successfully applied to encode cardinality constraints for SAT-solvers. To decrease the siz…
Vertex 2-coloring without monochromatic cycles
Michał Karpiński
In this paper we study a problem of vertex two-coloring of undirected graph such that there is no monochromatic cycle of given length. We show that this problem is hard to solve. W…
Multi-GPU parallel memetic algorithm for capacitated vehicle routing problem
Michał Karpiński, Maciej Pacut
The goal of this paper is to propose and test a new memetic algorithm for the capacitated vehicle routing problem in parallel computing environment. In this paper we consider simpl…