The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard combinatorial optimization problem with a number of important applications. In this paper, we present a ”reduce and solve” heuristic approach which combines problem reduction techniques with an Integer Linear Programming (ILP) solver (CPLEX). The key ingredient of the proposed approach is a set of group fixing ...

We study gauge fixing in the generalized Gupta-Bleuler quantization. In this method physical states are defined to be simultaneous null eigenstates of a set of quantum invariants. We apply the method to a solvable model proposed by Friedberg, Lee, Pang and Ren and show that no Gribov-type copies appears by construction. Gauge fixing is significant in quantization of gauge theories. Gribov ambig...

the increasing and unlimited cases of burdensome dowries beyond the husband's solvency, leading finally to the enforcement of dowry and divorce, had led some commentators to fix a certain maximum for dowry. the authors, in this article, intend to find a proper theory to resolve this matrimonial problem through reviewing the earlier and later islamic jurisprudents’ opinions. although according t...

Given a finite ground set, a set of subsets, and costs on the subsets, the set partitioning problem is to find a minimum cost partition of the ground set. Many combinatorial optimization problems can be formulated as set partitioning problems. We present an approximation algorithm that produces high-quality solutions in an acceptable amount of computation time. The algorithm is iterative and co...

We propose a novel method for construction of rectilinear BSP trees for ray shooting acceleration. The trees are contracted according to certain “preferred” set of rays. Particularly, we study ray sets formed by fixing either the direction or the origin of rays. The constructed trees can be used to answer ray shooting query for arbitrary rays, although with higher expected time complexity for r...

This paper presents a method for fitting 4-connected digital circles to a given set of points in 2D images in the presence of noise by maximizing the number of inliers, namely the optimal consensus set, while fixing the thickness. Our approach has a O(nlog n) time complexity and O(n) space complexity, n being the number of points, which is lower than previous known methods while still guarantee...

The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the order of the subsets of the partition is irrelevant. This kind of symmetry unnecessarily blows up the branchand-cut tree. We present a general tool, called orbi...

Microorganisms decompose herbicides and they may serve as bioindicators of soil changes following herbicide application. Certain microbial species may be used as bioherbicides. This study has shown that Azotobacter is most sensitive to herbicide application; it is, therefore, a reliable indicator of the biological value of soil. The numbers of this group of nitrogen-fixing bacteria decrease con...

3D printers based on the Fused Decomposition Modeling create objects layerby-layer dropping fused material. As a consequence, strong overhangs cannot be printed because the new-come material does not find a suitable support over the last deposed layer. In these cases, one can add some support structures (scaffolds) which make the object printable, to be removed at the end. In this paper we prop...

An annulus is defined as a set of points contained between two circles. This paper presents a method for fitting an annulus to a given set of points in a 2D images in the presence of noise by maximizing the number of inliers, namely the consensus set, while fixing the thickness. We present a deterministic algorithm that searches the optimal solution(s) within a time complexity of O(N), N being ...