VTMOP is a Fortran 2008 software package containing two modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. implements the algorithm of [ 32 ], which handles or more objectives, does not require any derivatives, and produces well-distributed points over Pareto front. The first module contains general framework problems by combining resp...

This paper analyses Rosca's ARL as a general framework for automatic subroutine discovery. We review and compare a number of heuristics for code selection, and experimentally test their e ectiveness in the ARL framework. We also propose and analyse a new heuristic, the Saliency, and two extensions to ARL: di usion of the new subroutines through mutation and the MaxFit technique to adaptively ch...

We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n logn) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Williamson. This improves the previous best algorithms in both performance guarantee and running time. A previous algorithm of Goemans and Kleinberg for the minimum latency problem requires an approximation algorithm for the ...

this paper investigates the earing phenomenon in deep drawing of aa3105 aluminum alloy, experimentally and numerically. earing defect is mainly attributed to the plastic anisotropy of sheet metal. in order to control such defect, predicting the evolution of ears in sheet metal forming analyses becomes indispensable. in this regard, the present study implements the advanced yield criterion bbc20...

We propose algorithms for Tucker approximation of 3-tensor, that use it only through tensor-by-vector-by-vector multiplication subroutine. In matrix case, Krylov methods are methods of choice to approximate dominant column and row subspace of sparse or structured matrix given through matrix-by-vector subroutine. However, direct generalization to tensor case, proposed recently by Eldén and Savas...

We give a randomized (Las-Vegas) parallel algorithm for computing strongly connected components of a graph with n vertices andm edges. The runtime is dominated byO(log n) multi-source parallel reachability queries; i.e. O(log n) calls to a subroutine that computes the union of the descendants of a given set of vertices in a given digraph. Our algorithm also topologically sorts the strongly conn...

:' We consider the problem of covering a weighted graph G = (V, E) by a set of " vertex-disjoint paths, such that the total weight of these paths is maximized. This problem is clearly NP-complete, since it contain's the Hamiltonian path problem as a special case. Three approximation algorithms for this problem are presented, exhibiting a complexity-performance trade-off. First, we develop an al...

Skew-Hamiltonian/Hamiltonian matrix pencils λS −H appear in many applications, including linear quadratic optimal control problems, H∞-optimization, certain multi-body systems and many other areas in applied mathematics, physics, and chemistry. In these applications it is necessary to compute certain eigenvalues and/or corresponding deflating subspaces of these matrix pencils. Recently develope...