Third-order boundary-value problems for differential equation play a very important role in a variety of different areas of applied mathematics and physics. Recently, third-order boundary-value problems have been many scholars’ research object. For example, heat conduction, chemical engineering, underground water flow, thermoelasticity, and plasma physics can produce boundary-value problems wit...

Linearly-implicit, approximate factorization methods are used to reduce the solution of multi-dimensional reaction–diffusion equations to a sequence of two-point boundaryvalue problems in ordinary differential equations which are solved analytically in a piecewise manner. It is shown that, depending on the allocation of the transient, diffusion and reaction terms to the second-order ordinary di...

in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.

objective neurodevelopmental disability is one of the most common problems of children referred to  pediatric neurology clinics. these children may suffer from speech delay, intellectual deficiency and behavioral disorder. some patients with neurodevelopomental delay, especially those with intellectual disability and speech problems, have abnormal electroencephalograms, without clinical seizure...

behavioral problems in cats have drawn more attention in recent years since they affect the cat-owner relationship. this study was designed to study the rate of cats with undesirable behaviors according to their owners. frequency of behavioral problems in 167 cats attending small animal hospital, faculty of veterinary medicine, university of tehran, was evaluated using a questionnaire. accordin...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...

among numerous np-hard problems, the traveling salesman problem (tsp) has been one of the most explored, yet unknown one. even a minor modification changes the problem’s status, calling for a different solution. the generalized traveling salesman problem (gtsp)expands the tsp to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...

the arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. the policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. in on-line created tours arc costs are not available for decision makers. the on-line traversed nodes are f...