Given a set of rectangular items of different sizes and a rectangular container, the aim of the bi-dimensional Orthogonal Packing Problem (OPP-2 for short) is to decide whether there exists a non-overlapping packing of the items in this container. The rotation of items is not allowed. In this paper we present a new exact algorithm for solving OPP-2, based upon the characterization of solutions ...

In this present work, the Kudryashov method and the functional variable method are used to construct exact solutions of the complex KdV equation. The Kudryashov method and the functional variable method are powerful methods for obtaining exact solutions of nonlinear evolution equations.

The first integral method is an efficient method for obtaining exact solutions of some nonlinear partial differential equations. This method can be applied to non integrable equations as well as to integrable ones. In this paper, the first integral method is used to construct exact solutions of the 2D Ginzburg-Landau equation.

Power grid vulnerability is a major concern of our society, and its protection problem is often formulated as a tri-level defender-attacker-defender model. However, this tri-level problem is computationally challenging. In this paper, we design and implement a Column-and-Constraint Generation algorithm to derive its optimal solutions. Numerical results on an IEEE system show that: (i) the devel...

Current DNA sequencing technologies do not read an entire chromosome from end to end but instead produce sets of short reads, i.e. fragments of the genome. Haplotype assembly is the problem of assigning each read to the correct chromosome in the set of chromosomes in a homologous group, with the aid of the reference sequence. In this paper, we extend an existing exact algorithm for haplotype as...

A simple method for solving Prandtl's integro-differential equation is proposed based on a new reproducing kernel space. Using a transformation and modifying the traditional reproducing kernel method, the singular term is removed and the analytical representation of the exact solution is obtained in the form of series in the new reproducing kernel space. Compared with known investigations, its ...

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

Shapelets are discriminative time series subsequences that allow generation of interpretable classification models, which provide faster and generally better classification than the nearest neighbor approach. However, the shapelet discovery process requires the evaluation of all possible subsequences of all time series in the training set, making it extremely computation intensive. Consequently...

In this paper we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real-life applications. The Branch & Cut method presented here is based on a cutting-plane algorithm that identifies violated inequalities of several classes of facet-inducing inequalities for the corresponding polyhedron. ...

The ‘perturbation source method’ (PSM) is a Monte Carlo perturbation method that calculates an exact k-eigenvalue change caused by cross-section changes. Although the PSM, which can consider effect of fission perturbation, was proposed long ago, it has garnered minimal interest as method. applicability PSM not been thoroughly elucidated hitherto. This study revisits and reviews associated algor...