11 citations · 25 across the 9 of their papers we have counts for
9 papers
A Pseudo-Boolean Polynomials Approach for Image Edge Detection
Tendai Mapungwana Chikake, Boris Goldengorin
We introduce a novel approach for image edge detection based on pseudo-Boolean polynomials for image patches. We show that patches covering edge regions in the image result in pseu…
Dimensionality Reduction Using pseudo-Boolean polynomials For Cluster Analysis
Tendai Mapungwana Chikake, Boris Goldengorin
We introduce usage of a reduction property of penalty-based formulation of pseudo-Boolean polynomials as a mechanism for invariant dimensionality reduction in cluster analysis proc…
Pseudo-Boolean Polynomials Approach To Edge Detection And Image Segmentation
Tendai Mapungwana Chikake, Boris Goldengorin, Alexey Samosyuk
We introduce a deterministic approach to edge detection and image segmentation by formulating pseudo-Boolean polynomials on image patches. The approach works by applying a binary c…
An almost linear time complexity algorithm for the Tool Loading Problem
Mikhail Cherniavskii, Boris Goldengorin
As shown by Tang, Denardo [9] the job Sequencing and tool Switching Problem (SSP) can be decomposed into the following two problems. Firstly, the Tool Loading Problem (TLP) - for a…
An improved KTNS algorithm for the job sequencing and tool switching problem
Mikhail Cherniavskii, Boris Goldengorin
We outline a new Max Pipe Construction Algorithm (MPCA) with the purpose to reduce the CPU time for the classic Keep Tool Needed Soonest (KTNS) algorithm. The KTNS algorithm is app…
An efficient model for the preemptive single machine scheduling of equal-length jobs
Artem Fomin, Boris Goldengorin
We propose a Boolean Linear Programming model for the preemptive single machine scheduling problem with equal processing times, arbitrary release dates and weights(priorities) mini…