Portfolio optimization is a pertinent topic of significant importance in the financial literature. During the portfolio construction, an investor confronts two important steps: portfolio selection and portfolio allocation. This article seeks to investigate portfolio optimization based on the...

Given a set of points in a plane, a spanning tree is a set of edges that connects all the points and contains no cycles. If each edge is weighted using the rectilinear distance metric, the rectilinear minimum spanning tree is a tree whose sum of edge weights is minimum. A naive approach to...

This paper defines isomorphism for network formation that is not mathematically isomorphic. Once the pattern of network formation is characterized, one can test for (i) location fixed effects, (ii) heterogeneity, (iii) private information allowing for long-term contracts. The paper provides...

Our dual objectives are to explore how commercially available quantum hardware and algorithms can solve real world problems in finance, and then to compare quantum solutions to their classical counterparts. Specifically, we use the D-Wave quantum annealing computer (D-Wave 2000Q) to address the...

We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions. For a discrete scenario set, we fi nd that the problem is NP-hard for each of the...

Component commonality - the use of the same version of a component across multiple products - is being increasingly considered as a promising way to offer high external variety while retaining low internal variety in operations. However, increasing commonality has both positive and negative cost...

Let denote the class of intersection graphs of linear 3-uniform hypergraphs. In this paper a polynomial algorithm solving the recognition problem for the graphs with bound on minimum vertex degree δ()≥ 13 is proposed

This paper deals with the problem of constructing directed trees of optimal weight and root with depth at most (||) (called − ). We first prove that the maximization and the minimization versions are equal-approximable under the that measures how the value of an approximate solution is placed...