Air defense is a crucial area for all naval combat systems. In this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. We define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. The optimal scheduling of the weapon results in an in...

We introduce in this paper an interface for modeling botanical trees that we term a sketch-and-spray interface. In using the interface, a user would sketch out various types of strokes to construct the main structures of a tree. A user could use a branch stroke to draw a single branch, a leaf stroke to draw a single leaf or a stem of leaves, or a copy stroke to draw a whole branch together with...

Certain branch-and-bound algorithms for determining the chromatic number of a graph are proved usually to take a number of steps which grows faster than exponentially with the number of vertices in the graph. A similar result holds for the number of steps in certain proofs of lower bounds for chromatic numbers. Key words, graph, chromatic number, algorithm, proof

We introduce a new branch-and-bound Max-SAT solver, Clone, which employs a novel approach for computing lower bounds. This approach allows Clone to search in a reduced space. Moreover, Clone is equipped with novel techniques for learning from soft conflicts. Experimental results show that Clone performs competitively with the leading Max-SAT solver in the broadest category of this year’s Max-SA...

An addition sequence problem is given a set of numbers X = {n1, n2, · · · , nm}, what is the minimal number of additions needed to compute all m numbers starting from 1? Downey et al. [9] showed that the addition sequence problem is NPcomplete. This problem has application in evaluating the monomials y1 , y2 , · · · , ym . In this paper, we present an algorithm to generate an addition sequence ...

In this paper we present a classification of parallel branch and bound algorithms, and elaborate on the consequences of particular parameter settings. The taxonomy is based upon how the algorithms handle the knowledge about the problem instance to be solved, generated during execution. The starting point of the taxonomy is the generally accepted description of the sequential branch and bound al...

The Molecular Distance Geometry Problem (MDGP) is the problem of finding the conformation of a molecule from inter-atomic distances. In some recent work, we proposed the interval Branch & Prune (iBP) algorithm for solving instances of the MDGP related to protein backbones. This algorithm is based on an artificial ordering given to the atoms of the protein backbones which allows the discretizati...

The solution of convex Mixed Integer Quadratic Programming (MIQP) problems with a general branch{and{bound framework is considered. It is shown how lower bounds can be computed eeciently during the branch{and{bound process. Improved lower bounds such as the ones derived in this paper can reduce the number of QP problems that have to be solved. The branch{and{bound approach is also shown to be s...

Motivation: We developed an algorithm to reconstruct ancestral sequences, taking into