Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times

We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a non-uniform amount of time travelling from one region to another before being able to search it for the presence of a moving target. In constraining not only where but when the search of each cell can take place, the problem more appropriately models the search of environments which cannot be easily partitioned into equally sized cells. An existing OSP bounding method in literature, the MEAN bound, is generalised to provide bounds for solving the new problem in a branch and bound framework. The main contribution of this paper is an enhancement, discounted MEAN (DMEAN), which greatly tightens the bound for the new and existing problems alike with almost no additional computation. We test the new algorithm against existing OSP bounding methods and show it leads to faster solution times for moving target search problems.     

电能计量管理标准化的实现

详细介绍了阳泉供电分公司电能计量中心如何实现电能计量管理的规范化、专业化、标准化,实现对客户公正、合法的计量,锻造＂合法、公正、公开、精确＂的工作宗旨和管理理念。     

求一类非凸规划问题全局解的确定性算法

本文对一类非凸规划问题(NP)给出一确定性全局优化算法.这类问题包括:在非凸的可行域上极小化有限个带指数的线性函数乘积的和与差,广义线性多乘积规划,多项式规划等.通过利用等价问题和线性化技巧提出的算法收敛到问题(NP)的全局极小.     

Facets and valid inequalities for the time-dependent travelling salesman problem

The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where the travel time between two cities depends not only on the distance between them, but also on the position of the arc in the tour. We consider two formulations proposed in the literature, we analyze the relationship between them and derive several families of valid inequalities and facets. In addition to their theoretical properties, they prove to be very effective in the context of a Branch and Cut algorithm.     

An application of the branch,bound, and remember algorithm to a new simple assembly line balancing dataset

The simple assembly line balancing problem (SALBP) is a well-studied NP-complete problem for which a new problem database of generated instances was published in 2013. This paper describes the application of a branch, bound, and remember (BB&R) algorithm using the cyclic best-first search strategy to this new database to produce provably exact solutions for 86% of the unsolved problems in this database. A new backtracking rule to save memory is employed to allow the BB&R algorithm to solve many of the largest problems in the database.     

Product line pricing for services with capacity constraints and dynamic substitution

In this paper, we address a service provider’s product line pricing problem for substitutable products in services, such as concerts, sporting events, or online advertisements. For each product, a static price is selected from a pre-defined set such that the total revenue is maximised. The products are differentiated by some of their attributes, and their availability is restricted due to individual capacity constraints. Furthermore, they are simultaneously sold during a common selling period at the end of which the service is delivered. Consumers differ from one another with respect to their willingness to pay, and, hence, their reservation prices vary depending on the product. In the event of a purchase, they choose the product that maximises their consumer surplus.     

Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree

Suppose that the eigenvalues of an Hermitian matrix A whose graph is a tree T are known, as well as the eigenvalues of the principal submatrix of A corresponding to a certain branch of T. A method for constructing a larger tree T?', in which the branch is ‘`duplicated’', and an Hermitian matrix A′ whose graph is T?' is described. The eigenvalues of A' are all of those of A, together with those corresponding to the branch, including multiplicities. This idea is applied (1) to give a solution to the inverse eigenvalue problem for stars, (2) to prove that the known diameter lower bound, for the minimum number of distinct eigenvalues among Hermitian matrices with a given graph, is best possible for trees of bounded diameter, and (3) to increase the list of trees for which all possible lists for the possible spectra are know. A generalization of the basic branch duplication method is presented.     

Uniform recursive trees: Branching structure and simple random downward walk

As models for spread of epidemics, family trees, etc., various authors have used a random tree called the uniform recursive tree. Its branching structure and the length of simple random downward walk (SRDW) on it are investigated in this paper. On the uniform recursive tree of size n, we first give the distribution law of ζn,m, the number of m-branches, whose asymptotic distribution is the Poisson distribution with parameter . We also give the joint distribution of the numbers of various branches and their covariance matrix. On Ln, the walk length of SRDW, we first give the exact expression of P(Ln=2). Finally, the asymptotic behavior of Ln is given.     

槐枝中总黄酮的含量测定

采用索氏提取法提取槐枝中的总黄酮,芦丁为对照,分光光度法测定其含量。样品浓度在16.104—96.624μg.mL-1范围内线性关系良好,相关系数r=0.9996。该方法简便、准确,可用于槐枝中总黄酮的含量测定。     

带非凸二次约束的二次比式和问题的全局优化算法(英文)

对带非凸二次约束的二次比式和问题(P)给出分枝定界算法,首先将问题(P)转化为其等价问题(Q),然后利用线性化技术,建立了(Q)松弛线性规划问题(RLP),通过对(RLP)可行域的细分及求解一系列线性规划问题,不断更新(Q)的上下界,从理论上证明了算法的收敛性,数值实验表明了算法的可行性和有效性.