<Para ID="Par1">In this paper, we consider an inverse problem of identifying one or more unknown cavities in a heat conductor. We propose an algorithm for reconstructing the position and shape of the unknown cavities using the measured surface temperature of the heat conductor. The heat conductor is discretized...</para>

This paper is aimed to employ a modified quasi-Newton equation in the framework of the limited memory BFGS method to solve large-scale unconstrained optimization problems. The modified secant equation is derived by means of a forth order tensor model to improve the curvature information of the...

The future of optical networks is focused on Wavelength Division Multiplexing (WDM) technology. WDM allows simultaneous transmissions of traffic on many non-overlapping channels (wavelengths). Since nowadays the majority of traffic requests only require a bandwidth of Mbps, there exists a waste...

<Para ID="Par1">The multitrip cumulative capacitated vehicle routing problem (mt-CCVRP) is a non-trivial extension of the classical CVRP: the goal is to minimize the sum of arrival times at demand nodes and each vehicle may perform several trips. Applications of this NP-hard problem can be found in disaster...</para>

<Para ID="Par1">In this paper, we investigate the optimal control problems governed by elliptic equations with integral constraint for state variable in one dimension by Legendre–Galerkin spectral methods. We deduce optimal conditions of the optimal control problems. Meanwhile, we obtain an a priori error...</para>

<Para ID="Par1">Large sparse symmetric matrix problems arise in a number of scientific and engineering fields such as fluid mechanics, structural engineering, finite element analysis and network analysis. In all such problems, the performance of solvers depends critically on the sum of the row bandwidths of the...</para>

We propose a parallel algorithm for computing exact solutions to the problem of minimizing the number of multileaf collimator apertures needed in step-and-shoot intensity modulated radiotherapy. These problems are very challenging particularly as the problem size increases. Here, we investigate...

<Para ID="Par1">We consider parameter optimization problems which are subject to constraints given by parametrized partial differential equations. Discretizing this problem may lead to a large-scale optimization problem which can hardly be solved rapidly. In order to accelerate the process of parameter...</para>

<Para ID="Par1">This paper proposes a new algorithm for the minimum spanning tree verification (MSTV) problem in undirected graphs. The MSTV problem is distinct from the minimum spanning tree construction problem. The above problems have been studied extensively, and there exist several papers in the literature...</para>

<Para ID="Par2">[Figure not available: see fulltext.] </AbstractSection> Copyright Springer Science+Business Media New York 2015