VRPTW的扰动恢复及其TABU SEARCH算法

本文对带时间窗的车辆路线安排扰动恢复问题进行了讨论,分析了各种可能的扰动:增加减少客户,时间窗、客户需求及路线可行性的扰动,构造了扰动模型.利用禁忌搜索算法对问题进行求解,同时通过对模型参数重新设置,得到了多个满足要求的不同的解,这样使解更具有实际可行性和有效性.     

Isotopic families of contact manifolds for elliptic PDE

A test for a function to be a solution of an elliptic PDE is given in terms of extensions, as solutions, from the boundaries inside the domains belonging to an isotopic family. It generalizes a result of Ehrenpreis for spheres moved along a straight line.

     

The Neumann problem for some degenerate elliptic equations

In the paper we study the equation L _u = f, where L is a degenerate elliptic operator, with Neumann boundary condition in a bounded open set μ. We prove existence and uniqueness of solutions in the space H(μ) for the Neumann problem.     

EXISTENCE OF PERIODIC SOLUTIONS OF SYSTEM OF DIFFERENCE EQUATIONS

This paper studies the nonautonomous nonlinear system of difference equationsΔx(n)=A(n)x(n)+f(n,x(n)),n∈Z,(*) where x(n)∈R~N,A(n)=(a_(ij)(n))N×N is an N×N matrix,with a-(ij)∈C(R,R) for i,j= 1,2,3,...,N,and f=(f_1,f_2,...,f_N)~T∈C(R×R~N,R~N),satisfying A(t+ω)=A(t),f(t+ω,z)=f(t,z) for any t∈R,(t,z)∈R×R~N andωis a positive integer.Sufficient conditions for the existence ofω-periodic solutions to equations (*) are obtained.     

Banach空间二阶非线性微分方程的弱Carathéodory解

本文定义了二阶微分方程的弱 Carathéodory解 ,在不涉及紧型条件的情形下 ,直接用迭代法证明了 Banach空间二阶非线性常微分方程两点边值问题存在唯一解 ,并给出逼近解迭代序列的误差估计 ,对周期边值问题得到类似的结果     

A possible counterexample to well posedness of entropy solutions and to Godunov scheme convergence

A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well posed.

     

A new family of proximity graphs: Class cover catch digraphs

Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given.     

Challenging Students to View the Concept of Area in Triangles in a Broad Context: Exploiting the Features of Cabri-II

This study focuses on the constructions in terms of area and perimeter in equivalent triangles developed by students aged 12–15 years-old, using the tools provided by Cabri-Geometry II [Labore (1990). Cabri-Geometry (software), Université de Grenoble]. Twenty-five students participated in a learning experiment where they were asked to construct: (a) pairs of equivalent triangles “in as many ways as possible” and to study their area and their perimeter using any of the tools provided and (b) “any possible sequence of modifications of an original triangle into other equivalent ones”. As regards the concept of area and in contrast to a paper and pencil environment, Cabri provided students with different and potential opportunities in terms of: (a) means of construction, (b) control, (c) variety of representations and (d) linking representations, by exploiting its capability for continuous modifications. By exploiting these opportunities in the context of the given open tasks, students were helped by the tools provided to develop a broader view of the concept of area than the typical view they would construct in a typical paper and pencil environment.     

超尺寸物品装箱问题及其算法

本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法，我们提出了一个评价效率更高的目标函数，证明了在此目标函数下两步法的渐近最坏比不小于2，并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA，证明了在新目标函数下其渐近最坏比不超过7/4。