Journal of Applied Mathematics Impact Factor & Information

Publisher: Hindawi Publishing Corporation, Hindawi Publishing Corporation

Journal description

Journal of Applied Mathematics is a refereed journal devoted to the publication of original research papers and review articles in all areas of applied, computational, and industrial mathematics. Subject areas include (but are not limited to): Approximation Theory, Computing, Control and Systems, Differential Equations and Dynamical Systems, Financial Mathematics, Fluid Mechanics and Solid Mechanics, Fractional Calculus and its Applications, Linear and Nonlinear Waves, Numerical Algorithms, Numerical Analysis, Operations Research, Optimization, Partial Differential Equations, Probability and Stochastic Processes, Simulation, Statistics, Wavelets and Wavelet Transforms.

Current impact factor: 0.72

Impact Factor Rankings

2015 Impact Factor Available summer 2016
2013 / 2014 Impact Factor 0.72
2012 Impact Factor 0.834
2011 Impact Factor 0.656
2010 Impact Factor 0.63

Impact factor over time

Impact factor

Additional details

5-year impact 0.00
Cited half-life 1.60
Immediacy index 0.21
Eigenfactor 0.00
Article influence 0.00
Website Journal of Applied Mathematics website
Other titles Journal of applied mathematics (Online), JAM, Applied mathematics
ISSN 1110-757X
OCLC 51160736
Material type Document, Periodical, Internet resource
Document type Internet Resource, Computer File, Journal / Magazine / Newspaper

Publisher details

Hindawi Publishing Corporation

  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author can archive a post-print version
  • Conditions
    • Publisher's version/PDF may be used
    • Creative Commons Attribution License
    • Eligible UK authors may deposit in OpenDepot
    • All titles are open access journals
  • Classification
    ​ green

Publications in this journal

  • [Show abstract] [Hide abstract]
    ABSTRACT: A smooth curve interpolation scheme for positive, monotone and convex data is developed. This scheme uses rational cubic Ball representation with four shape parameters in its description. Conditions of two shape parameters are derived in such a way that they preserve the shape of the data, whereas the other two parameters remain free to enable the user to modify the shape of the curve. The degree of smoothness is 𝐶1.The outputs from a number of numerical experiments are presented.
    Journal of Applied Mathematics 06/2015; 2015:9.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Sea freight transportation involves moving huge amounts of freights among maritime locations widely spaced by means of container vessels. The time required to serve container vessels is the most relevant indicator when assessing the competitiveness of a maritime container terminal. In this paper, two main logistic problems stemming from the transshipment of containers in the seaside of a maritime container terminal are addressed, namely, the Berth Allocation Problem aimed at allocating and scheduling incoming vessels into berthing positions along the quay and the Quay Crane Scheduling Problem, whose objective is to schedule the loading and unloading tasks associated with a container vessel. For solving them, two Migrating Birds Optimization (MBO) approaches are proposed. The MBO is a recently proposed nature-inspired algorithm based on the V -formation flight of migrating birds. In this algorithm, a set of solutions of the problem at hand, called birds, cooperate among themselves during the search process by sharing information within a V -line formation. The computational experiments performed over well-known problem instances reported in the literature show that the performance of our proposed MBO approaches is highly competitive and presents a better performance in terms of running time than the best approximate approach proposed in the literature.
    Journal of Applied Mathematics 05/2015; 2015(5). DOI:10.1155/2015/781907
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Activity floats are vital for project scheduling, such as total floats which determine the maximum permissible delays of activities. Moreover, activity paths in activity networks present essences of many project scheduling problems; for example, the time-cost tradeoff is to shorten long paths at lower costs. We discovered relationships between activity floats and paths and established a float-path theory. The theory helps to compute path lengths using activity floats and analyze activity floats using paths, which helps to transmute a problem into the other simpler one. We discussed applications of the float-path theory and applied it to solve the time-cost tradeoff problem (TCTP), especially the nonlinear and discrete versions. We proposed a simplification from an angle of path as a preprocessing technique for the TCTP. The simplification is a difficult path problem, but we transformed it into a simple float problem using the float-path theory. We designed a polynomial algorithm for the simplification, and then the TCTP may be solved more efficiently.
    Journal of Applied Mathematics 02/2015; 2015:1-17. DOI:10.1155/2015/539374
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We formulate an age-structured SIS epidemic model with periodic parameters, which includes host population and vector population. The host population is described by two partial differential equations, and the vector population is described by a single ordinary differential equation. The existence problem for endemic periodic solutions is reduced to a fixed point problem of a nonlinear integral operator acting on locally integrable periodic functions. We obtain that if the spectral radius of the Fréchet derivative of the fixed point operator at zero is greater than one, there exists a unique endemic periodic solution, and we investigate the global attractiveness of disease-free steady state of the normalized system.
    Journal of Applied Mathematics 02/2015; 2015:1-12. DOI:10.1155/2015/838312
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We introduce and study well-posedness in connection with the symmetric vector quasi-equilibrium problem, which unifies its Hadamard and Levitin-Polyak well-posedness. Using the nonlinear scalarization function, we give some sufficient conditions to guarantee the existence of well-posedness for the symmetric vector quasi-equilibrium problem.
    Journal of Applied Mathematics 02/2015; 2015:1-10. DOI:10.1155/2015/108357
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Let F (x, y) = a s (x) y s + a s 1 (x) y s 1 +⋯+ a o x be a real-valued polynomial function in which the degree s of y in F (x, y) is greater than or equal to 1. For any polynomial y (x), we assume that T: R (x) → R (x) is a nonlinear operator with T (y (x)) = F (x, y( x)). In this paper, we will find an eigenfunction y (x) ∑ R x to satisfy the following equation: F (x, y (x)) = a y (x) for some eigenvalue a ∑ R and we call the problem F (x, y (x)) = a y x a fixed point like problem. If the number of all eigenfunctions in F x, y x = a y x is infinitely many, we prove that (i) any coefficients of F (x, y), a s (x), a s 1 (x),⋯, a 0 (x), are all constants in R and (ii) y (x) is an eigenfunction in F (x, y (x))= a y (x) if and only if y x ∑ R.
    Journal of Applied Mathematics 02/2015; 2015:1-6. DOI:10.1155/2015/516159
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Calculation of assortative mixing by degree in networks indicates whether nodes with similar degree are connected to each other. In networks with scale-free distribution high values of assortative mixing by degree can be an indication of a hub-like core in networks. Degree correlation has generally been used to measure assortative mixing of a network. But it has been shown that degree correlation cannot always distinguish properly between different networks with nodes that have the same degrees. The so-called -metric has been shown to be a better choice to calculate assortative mixing. The -metric is normalized with respect to the class of networks without self-loops, multiple edges, and multiple components, while degree correlation is always normalized with respect to unrestricted networks, where self-loops, multiple edges, and multiple components are allowed. The challenge in computing the normalized -metric is in obtaining the minimum and maximum value within a specific class of networks. We show that this can be solved by using linear programming. We use Lagrangian relaxation and the subgradient algorithm to obtain a solution to the -metric problem. Several examples are given to illustrate the principles and some simulations indicate that the solutions are generally accurate.
    Journal of Applied Mathematics 02/2015; 2015:1-9. DOI:10.1155/2015/580361
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We use a modified S-iterative process to prove some strong and -convergence results for asymptotically nonexpansive type mappings in uniformly convex hyperbolic spaces, which includes Banach spaces and CAT(0) spaces. Thus, our results can be viewed as extension and generalization of several known results in Banach spaces and CAT(0) spaces (see, e.g., Abbas et al. (2012), Abbas et al. (2013), Bruck et al. (1993), and Xin and Cui (2011)) and improve many results in the literature.
    Journal of Applied Mathematics 02/2015; 2015:1-7. DOI:10.1155/2015/510798