The connected <Emphasis Type="Italic">p</Emphasis>-median problem on block graphs

In this paper, we study a variant of the p-median problem on block graphs G in which the p-median is asked to be connected, and this problem is called the connected p-median problem. We first show that the connected p-median problem is NP-hard on block graphs with multiple edge weights. Then, we propose an O(n)-time algorithm for solving the problem on unit-edge-weighted block graphs, where n is the number of vertices in G.     

A new heuristic approach for the P-median problem

The Euclidean p-median problem is concerned with the decision of the locations for public service centres. Existing methods for the planar Euclidean p-median problems are capable of efficiently solving problems of relatively small scale. This paper proposes two new heuristic algorithms aiming at problems of large scale. Firstly, to reflect the different degrees of proximity to optimality, a new kind of local optimum called level-m optimum is defined. For a level-m optimum of a p-median problem, where m<p, each of its subsets containing m of the p partitions is a global optimum of the corresponding m-median subproblem. Starting from a conventional local optimum, the first new algorithm efficiently improves it to a level-2 optimum by applying an existing exact algorithm for solving the 2-median problem. The second new algorithm further improves it to a level-3 optimum by applying a new exact algorithm for solving the 3-median problem. Comparison based on experimental results confirms that the proposed algorithms are superior to the existing heuristics, especially in terms of solution quality.     

A Lagrangian search method for the <Emphasis Type="Italic">P</Emphasis>-median problem

In this paper, we propose a novel algorithm for solving the classical P-median problem. The essential aim is to identify the optimal extended Lagrangian multipliers corresponding to the optimal solution of the underlying problem. For this, we first explore the structure of the data matrix in P-median problem to recast it as another equivalent global optimization problem over the space of the extended Lagrangian multipliers. Then we present a stochastic search algorithm to find the extended Lagrangian multipliers corresponding to the optimal solution of the original P-median problem. Numerical experiments illustrate that the proposed algorithm can effectively find a global optimal or very good suboptimal solution to the underlying P-median problem, especially for the computationally challenging subclass of P-median problems with a large gap between the optimal solution of the original problem and that of its Lagrangian relaxation.     

Heuristic Solution Methods for Two Location Problems with Unreliable Facilities

In this paper, the p-median and p-centre problems are generalized by considering the possibility that one or more of the facilities may become inactive. The unreliable p-median problem is defined by introducing the probability that a facility becomes inactive. The (p, q)-centre problem is defined when p facilities need to be located but up to q of them may become unavailable at the same time. An heuristic procedure is presented for each problem. A rigorous procedure is discussed for the (p, q)-centre problem. Computational results are presented.     

An Algorithm for Solving Capacitated Multicommodity <Emphasis Type="Italic">p</Emphasis>-median Transportation Problems

An algorithm for solving a special capacitated multicommodity p-median transportation problem (CMPMTP), which arises in container terminal management, is presented. There are some algorithms to solve similar kinds of problems. The formulation here is different from the existing modelling of the p-median or some related location problems. We extend the existing work by applying a Lagrangean relaxation to the CMPMTP. In order to obtain a satisfactory solution, a heuristic branch-and-bound algorithm is designed to search for a better solution, if one is possible. A comparison is also made with different algorithms.     

The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers

This paper deals with the pos/neg-weighted p-median problem on tree graphs where all customers are modeled as subtrees. We present a polynomial algorithm for the 2-median problem on an arbitrary tree. Then we improve the time complexity to O(n log n) for the problem on a balanced tree, where n is the number of the vertices in the tree.     

Approximate solution of the <Emphasis Type="Italic">p</Emphasis>-median minimization problem

A version of the facility location problem (the well-known p-median minimization problem) and its generalization—the problem of minimizing a supermodular set function—is studied. These problems are NP-hard, and they are approximately solved by a gradient algorithm that is a discrete analog of the steepest descent algorithm. A priori bounds on the worst-case behavior of the gradient algorithm for the problems under consideration are obtained. As a consequence, a bound on the performance guarantee of the gradient algorithm for the p-median minimization problem in terms of the production and transportation cost matrix is obtained.     

Constructive heuristics for the uncapacitated continuous location-allocation problem

The multisource location-allocation problem in continuous space is investigated. Two constructive heuristic techniques are proposed to solve this problem. Both methods are based on designing suitable schemes for the generation of the initial solutions. The first considers the furthest distance rule and is enhanced by schemes borrowed from tabu search such as constructing the forbidden regions and freeing strategy. The second considers the discrete solutions found when solving the p-median problem. Some results on existing test problems are presented.     

Equivalence of two definitions of a generalized <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> solution to the initial-boundary value problem for the wave equation

In our previous papers, we introduced the notion of a generalized solution to the initial-boundary value problem for the wave equation with a boundary function µ(t) such that the integral ∫ ₀ ^T (T ? t)|µ(t)| ^p dt exists. Here we prove that this solution is a unique solution to the problem in L _p that satisfies the corresponding integral identity.     

Branch and Bound Algorithm for the <Emphasis Type="Italic">p</Emphasis>-Median Transportation Problem

The p-median transportation problem is to determine an optimal solution to a transportation problem having an additional constraint restricting the number of active supply points. The model is discussed as an example of a public sector location/allocation problem. A branch and bound procedure is proposed to solve the problem. Lagrangian relaxation is used to provide lower bounds. Computational results are given.     

On the Regularity of a Boundary Point for the <Emphasis Type="Italic">p</Emphasis>(<Emphasis Type="Italic">x</Emphasis>)-Laplacian

The Dirichlet problem for the p(x)-Laplacian with a continuous boundary function is considered, and a sufficient condition is found for the continuity of its solution at a boundary point, assuming that the exponent p(x) satisfies the log-Hölder continuity condition at this point.     

The existence of semiclassical states for some <Emphasis Type="Italic">p</Emphasis>-Laplacian equation with critical exponent

In this paper, we study the existence of semiclassical states for some p-Laplacian equation. Under given conditions and minimax methods, we show that this problem has at least one positive solution provided that ε ≤ E; for any m ∈ ?, it has m pairs solutions if ε ≤ E _m , where E, E_m are sufficiently small positive numbers. Moreover, these solutions are closed to zero in W^1,p(? ^N ) as ε → 0.     

On the convergence of the formal Fourier solution of the wave equation with a summable potential

The convergence of the formal Fourier solution to a mixed problem for the wave equation with a summable potential is analyzed under weaker assumptions imposed on the initial position u(x, 0) = φ(x) than those required for a classical solution up to the case φ(x) ∈ L_p[0,1] for p > 1. It is shown that the formal solution series always converges and represents a weak solution of the mixed problem.     

The one dimensional parabolic <Emphasis Type="Italic">p</Emphasis>(<Emphasis Type="Italic">x</Emphasis>)-Laplace equation

The Dirichlet problem for the degenerate and singular parabolic p(x)-Laplace equation with one spatial variable is considered. We prove the existence of the unique weak solution such that the derivatives u _t and u _x of a solution u belong to \({L_{\infty}}\). Moreover for the singular case we prove the existence of the strong solution i.e. such that u _t , u _x and u _xx belong to \({L_{\infty}}\).     

Positive solutions of <Emphasis Type="Italic">p</Emphasis>-th Yamabe type equations on graphs

Let G = (V,E) be a finite connected weighted graph, and assume 1 ? α ? p ? q. In this paper, we consider the p-th Yamabe type equation ―?_pu+hu^q―1 = λfu^α―1 on G, where ?_p is the p-th discrete graph Laplacian, h < 0 and f > 0 are real functions defined on all vertices of G. Instead of H. Ge’s approach [Proc. Amer. Math. Soc., 2018, 146(5): 2219–2224], we adopt a new approach, and prove that the above equation always has a positive solution u > 0 for some constant λ ∈ ?. In particular, when q = p, our result generalizes Ge’s main theorem from the case of α ? p > 1 to the case of 1 ? α ? p, It is interesting that our new approach can also work in the case of α ? p > 1.     

Behavior of the formal Fourier solution of the wave equation with a summable potential

The convergence of the formal Fourier solution to a mixed problem for the wave equation with a summable potential is analyzed under weaker assumptions imposed on the initial position u(x, 0) = φ(x) than those required for a classical solution up to the case φ(x)∈ L_p[0,1] for p > 1. It is shown that the formal solution series always converges and represents a weak solution of the mixed problem.     

The local lifting problem for <Emphasis Type="Italic">D</Emphasis><Subscript>4</Subscript>

For a prime p, a cyclic-by-p group G and a G-extension L|K of complete discrete valuation fields of characteristic p with algebraically closed residue field, the local lifting problem asks whether the extension L|K lifts to characteristic zero. In this paper, we characterize D₄-extensions of fields of characteristic two, determine the ramification breaks of (suitable) D₄- extensions of complete discrete valuation fields of characteristic two, and solve the local lifting problem in the affirmative for every D₄-extension of complete discrete valuation fields of characteristic two with algebraically closed residue field; that is, we show that D₄ is a local Oort group for the prime 2.     

<Emphasis Type="Italic">M</Emphasis> <Subscript> <Emphasis Type="Italic">p</Emphasis> </Subscript>-supplemented subgroups of finite groups

A subgroup K of G is M_p-supplemented in G if there exists a subgroup B of G such that G = KB and TB < G for every maximal subgroup T of K with |K: T| = p^α. In this paper we prove the following: Let p be a prime divisor of |G| and let H be ap-nilpotent subgroup having a Sylow p-subgroup of G. Suppose that H has a subgroup D with D_p ≠ 1 and |H: D| = p_α. Then G is p-nilpotent if and only if every subgroup T of H with |T| = |D| is M_p-supplemented in G and N_G(T_p)/C_G(T_p) is a p-group.     

Parametric AE-solution sets to the parametric linear systems with multiple right-hand sides and parametric matrix equation A(p)X = B(p)

In this paper, the parametric matrix equation A(p)X = B(p) whose elements are linear functions of uncertain parameters varying within intervals are considered. In this matrix equation A(p) and B(p) are known m-by-m and m-by-n matrices respectively, and X is the m-by-n unknown matrix. We discuss the so-called AE-solution sets for such systems and give some analytical characterizations for the AE-solution sets and a sufficient condition under which these solution sets are bounded. We then propose a modification of Krawczyk operator for parametric systems which causes reduction of the computational complexity of obtaining an outer estimation for the parametric united solution set, considerably. Then we give a generalization of the Bauer-Skeel and the Hansen-Bliek-Rohn bounds for enclosing the parametric united solution set which also enables us to reduce the computational complexity, significantly. Also some numerical approaches based on Gaussian elimination and Gauss-Seidel methods to find outer estimations for the parametric united solution set are given. Finally, some numerical experiments are given to illustrate the performance of the proposed methods.     

New class of hybrid BDF methods for the computation of numerical solutions of IVPs

A new class of hybrid BDF-like methods is presented for solving systems of ordinary differential equations (ODEs) by using the second derivative of the solution in the stage equation of class 2 + 1hybrid BDF-like methods to improve the order and stability regions of these methods. An off-step point, together with two step points, has been used in the first derivative of the solution, and the stability domains of the new methods have been obtained by showing that these methods are A-stable for order p, p =?3,4,5,6,7and A(α)-stable for order p, 8 ≤ p ≤?14. The numerical results are also given for four test problems by using variable and fixed step-size implementations.