A Hybrid Approach to Scheduling with Earliness and Tardiness Costs

A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time.     

仅用1表示数的最少个数

设n为正整数,f(n)是可以用1以及任意多个 号和×号(以及括号)来表示n时所用1的最少的个数.本文确定了n在若干情形时f(n)的值,改进了参考文献的部分结果,并提出了若干新的猜想.     

The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs

We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem. We show that for the cases with k=1 and k=2, every optimal solution is integral. In contrast to this, for every k≥3 there exist instances where every optimal solution takes non-integral values. Received: August 2001 / Accepted: January 2002?Published online March 27, 2002     

Mean Value on the Difference Between a Quadratic Residue and Its Inverse Modulo p

The main purpose of this paper is to use the generalized Bernoulli numbers, Gauss sums and the mean value theorems of Dirichlet L-functions between a quadratic residue and its inverse modulo p value formula. to study the asymptotic property of the difference （a prime）, and to give an interesting hybrid mean     

解读安德列耶夫的《沉默》

详细分析了安德列耶夫的短篇小说<沉默>,通过解读女儿薇拉、妻子奥尔加不同方式、不同内涵的"沉默",以及神父伊格纳季为了打破"沉默"所做出的努力和他的最终失败,探讨了小说中"沉默"的多义性.     

浅析法律文书语言的精确性与模糊性

法律文书由于具有很强的专业性,因而也就具有应用文书的一般写作特点,尤其在语言的精确性方面要求甚严,但模糊语言的恰当运用,同样能不偏不倚地准确表意,使文书能达到其基本地的使用目的。     

Some proximity and sensitivity results in quadratic integer programming

We show that for any optimal solution for a given separable quadratic integer programming problem there exist an optimal solution for its continuous relaxation such that wheren is the number of variables and(A) is the largest absolute subdeterminant of the integer constraint matrixA. Also for any feasible solutionz, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution having greater objective function value and with . We further prove, under some additional assumptions, that the distance between a pair of optimal solutions to an integer quadratic programming problem with right hand side vectorsb andb, respectively, depends linearly on b–b₁. Finally the validity of all the results for nonseparable mixed-integer quadratic programs is established. The proximity results obtained in this paper are extensions of some of the results described in Cook et al. (1986) for linear integer programming.This research was partially supported by Natural Sciences and Engineering Research Council of Canada Grant 5-83998.     

Evaluation of Orbital- and Ground State Energies of Some Open- and Closed-Shell Atoms over Integer and Noninteger Slater Type Orbitals

Ab initio calculations of the orbital and the ground state energies of some open- and closed-shell atoms over Slater type orbitals with quantum numbers integer and Slater type orbitals with quantum numbers noninteger have been performed. In order to increase the efficiency of these calculations the atomic two-electron integrals were expressed in terms of incomplete beta function. Results were observed to be in good agreement with the literature.     

Stochastic on-line knapsack problems

Different classes of on-line algorithms are developed and analyzed for the solution of {0, 1} and relaxed stochastic knapsack problems, in which both profit and size coefficients are random variables. In particular, a linear time on-line algorithm is proposed for which the expected difference between the optimum and the approximate solution value isO(log^3/2 n). An(1) lower bound on the expected difference between the optimum and the solution found by any on-line algorithm is also shown to hold.Corresponding author.Partially supported by the Basic Research Action of the European Communities under Contract 3075 (Alcom).Partially supported by research project Models and Algorithms for Optimization of the Italian Ministry of University and Scientific and Technological Research (MURST 40%).