No abstract

We study the uniqueness and nondegeneracy of positive solutions of div (ρ∇u) + ρ(−gu + hu p ) = 0 in a ball, the entire space, an annulus, or an exterior domain under the Dirichlet boundary condition. Mathematics Subject Classification

The knapsack problem and the minimum spanning tree problem are both fundamental in operations research and computer science. We are concerned with a combination of these two problems. That is, we are given a knapsack of a fixed capacity, as well as an undirected graph where each edge is associated with profit and weight. The problem is to fill the knapsack with a feasible spanning tree such that the tree profit is maximized. We prove this problem NP-hard, present upper and lower bounds, develop a branch-and-bound algorithm to solve the problem to optimality and propose a shooting method to accelerate computation. We evaluate the developed algorithm through a series of numerical experiments for various types of test problems.

Planar elastica problem is a classical but has broad connections with various fields, such as elliptic functions, di¤erential geometry, soliton theory, material mechanics, etc. This paper regards classical elastica as a theory corresponding to Lebesgue L 2 case, and extends it to L p cases. For the sake of the e¤ect of p-Laplacian, novel curious solutions appear especially for cases p > 2. These solutions never appear in 1 < p a 2 cases and we call them flat-core solutions according to Takeuchi [6, 7].

No abstract