Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem

Most writers on frequency assignment algorithms have described the details of a single algorithm, and evaluated the algorithm on selected data sets. There has been relatively little emphasis on describing the common features that are important if an algorithm is to have good performance. This paper describes the key features, with particular emphasis on algorithms for weighted fixed spectrum problems. The use of algorithms handling weighted constraints has become increasingly common in recent years. The advantages and disadvantages of weighting constraints are demonstrated.     

算子权移位的换位代数的交换性

令T是以{Wk}∞k=1B(Cn)为权序列的内射算子权移位.设T是强不可约的,而且sup1k<∞‖W-1k‖< ∞.用A′(T)表示T的换位代数,radA′(T)表示A′(T)的Jacobson根.本文刻划了radA′(T)并且证明了商代数A′(T)/radA′(T)是交换的.     

Correlative Sparsity in Primal-Dual Interior-Point Methods for LP,SDP, and SOCP

Exploiting sparsity has been a key issue in solving large-scale optimization problems. The most time-consuming part of primal-dual interior-point methods for linear programs, second-order cone programs, and semidefinite programs is solving the Schur complement equation at each iteration, usually by the Cholesky factorization. The computational efficiency is greatly affected by the sparsity of the coefficient matrix of the equation which is determined by the sparsity of an optimization problem (linear program, semidefinite program or second-order cone program). We show if an optimization problem is correlatively sparse, then the coefficient matrix of the Schur complement equation inherits the sparsity, and a sparse Cholesky factorization applied to the matrix results in no fill-in. S. Kim’s research was supported by Kosef R01-2005-000-10271-0 and KRF-2006-312-C00062.     

A fuzzy-stochastic OWA model for robust multi-criteria decision making

All realistic Multi-Criteria Decision Making (MCDM) problems face various kinds of uncertainty. Since the evaluations of alternatives with respect to the criteria are uncertain they will be assumed to have stochastic nature. To obtain the uncertain optimism degree of the decision maker fuzzy linguistic quantifiers will be used. Then a new approach for fuzzy-stochastic modeling of MCDM problems will be introduced by merging the stochastic and fuzzy approaches into the OWA operator. The results of the new approach, entitled FSOWA, give the expected value and the variance of the combined goodness measure for each alternative. Robust decision depends on the combined goodness measures of alternatives and also on the variations of these measures under uncertainty. In order to combine these two characteristics a composite goodness measure will be defined. The theoretical results will be illustrated in a watershed management problem. By using this measure will give more sensitive decisions to the stakeholders whose optimism degrees are different than that of the decision maker. FSOWA can be used for robust decision making on the competitive alternatives under uncertainty.     

两两NQD列加权和的安全收敛性

本文研究两两NQD系加权和的完全收敛性，证明了一般双下标加权系数的加权部分和的完全收敛性，改进了吴群英（2002）的结果。     

带粗糙核的Marcinkiewicz积分算子在加权Herz空间中的有界性

讨论了一类带有粗糙核的Marcinkiewicz积分算子在加权Herz空间上的有界性.     

变量核奇异积分和分数次微分加权范不等式

用T和D^γ（0 ≤ γ ≤ 1）分别表示变量核奇异积分和分数次微分算子.T^*和T^#分别为T的共轭算子及拟共轭算子.利用球调和多项式展式，本文得到了TD^γ-D^γT和（T^*-T^#）D^γ在?^q，λ_ω（Rⁿ）上的有界性.同时也得到了变量核奇异积分的积T₁T₂和拟积T₁°T₂的加权范不等式.     

Weighted approximation of continuous functions by sequences of linear positive operators

In this work we obtain, under suitable conditions, theorems of Korovkin type for spaces with different weight, composed of continuous functions defined on unbounded regions. These results can be seen as an extension of theorems by Gadjiev in [4] and [5].     

Existence of T-solution for degenerated problem via Minty’s lemma

We study the existence result of solutions for the nonlinear degenerated elliptic problem of the form, -div（a（x, u,△↓u）） = F in Ω, where Ω is a bounded domain of R^N, N≥2, a ：Ω×R×R^N→R^N is a Carathéodory function satisfying the natural growth condition and the coercivity condition, but they verify only the large monotonicity. The second term F belongs to W^-1,p′（Ω, w^＊）. The existence result is proved by using the L^1-version of Minty＇s lemma.     

Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time

We are interested in the problem of scheduling orders for different product types in a facility with a number of machines in parallel. Each order asks for certain amounts of various different product types which can be produced concurrently. Each product type can be produced on a subset of the machines. Two extreme cases of machine environments are of interest. In the first case, each product type can be produced on one and only one machine which is dedicated to that product type. In the second case, all machines are identical and flexible; each product type can be produced by any one of the machines. Moreover, when a machine in this case switches over from one product type to another, no setup is required. Each order has a release date and a weight. Preemptions are not allowed. The objective is minimizing the total weighted completion time of the orders. Even when all orders are available at time 0, both types of machine environments have been shown to be NP-hard for any fixed number (≥2) of machines. This paper focuses on the design and analysis of approximation algorithms for these two machine environments. We also present empirical comparisons of the various algorithms. The conclusions from the empirical analyses provide insights into the trade-offs with regard to solution quality, speed, and memory space. Electronic Supplementary Material The online version of this article () contains supplementary material, which is available to authorized users. This research is supported by the National Science Foundation through grants DMI-0300156 and DMI-0245603.