in this paper, inverse laplace transform method is applied to analytical solution of the fractional sturm-liouville problems. the method introduces a powerful tool for solving the eigenvalues of the fractional sturm-liouville problems. the results  how that the simplicity and efficiency of this method.

We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network simplex algorithms for the standard and fo...

Periodic global updates of dual variables have been shown to yield a substantial speed advantage in implementations of push-relabel algorithms for the maximum flow and minimum cost flow problems. In this paper, we show that in the context of the bipartite matching and assignment problems, global updates yield a theoretical improvement as well. For bipartite matching, a pushrelabel algorithm tha...

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

in this paper, we consider the second-kind chebyshev polynomials (skcps) for the numerical solution of the fractional optimal control problems (focps). firstly, an introduction of the fractional calculus and properties of the shifted skcps are given and then operational matrix of fractional integration is introduced. next, these properties are used together with the legendre-gauss quadrature fo...

The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem and investigate implementations of the method that take advantage of assignment's special structure. The results show that the method is very promising for practical use.

We use the recently established higher-level Bailey lemma and Bose–Fermi polynomial identities for the minimal models M(p, p) to demonstrate the existence of a Bailey flow from M(p, p) to the coset models (A (1) 1 )N ×(A (1) 1 )N ′/(A (1) 1 )N+N ′ where N is a positive integer and N ′ is fractional, and to obtain Bose–Fermi identities for these models. The fermionic side of these identities is ...

We use the recently established higher-level Bailey lemma and Bose–Fermi polynomial identities for the minimal models M(p, p) to demonstrate the existence of a Bailey flow from M(p, p) to the coset models (A (1) 1 )N ×(A (1) 1 )N ′/(A (1) 1 )N+N ′ where N is a positive integer and N ′ is fractional, and to obtain Bose–Fermi identities for these models. The fermionic side of these identities is ...