共查询到20条相似文献,搜索用时 78 毫秒
1.
2.
3.
4.
基于遗传算法的大学课程表问题研究 总被引:3,自引:0,他引:3
课程表问题是时间表问题之一 ,也是 NP难问题 .根据大学授课形式的特点建立了大学课程表问题的数学模型 ,给出了求解该问题的遗传算法 .根据模型和大学课程表问题的特点设计了一种全新的编码 ,提出了一种新形式的交叉方式 .实验结果表明该方法是可行和有效的 . 相似文献
5.
研究了一类具有转点的右端不连续二阶半线性奇摄动边值问题解的渐近性.首先,在间断处将原问题分为左右两个问题,通过修正左问题退化问题的正则化方程,提高了左问题渐近解的精度,并利用Nagumo定理证明了左问题光滑解的存在性.其次,证明了右问题具有空间对照结构的解,并通过在间断点的光滑缝接,得到了原问题的渐近解.最后,通过一个算例验证了结果的正确性. 相似文献
6.
7.
韩中庚 《数学的实践与认识》2009,39(16)
针对2008年全国研究生数学建模竞赛C题"货运列车的编组调度问题",首先介绍了问题的背景和问题的构成,并提出了6个要解决的问题;然后概要地分析介绍了解决这6个具体问题的思想方法;接着给出了具体解决问题的实现方法、主要模型和求解思路;最后对参赛队的总体做法和存在问题情况做了较详细的分析,并就与这个题目有关的几个问题做了说明. 相似文献
8.
崔春生 《数学的实践与认识》2014,(8)
从目前研究生入学考试中出现的几种新的运筹学运输问题出发,探讨了各种运输问题与传统运输问题的差异。提出以传统运输问题为本,将非传统运输问题转化为传统运输问题借助表上作业法求解的思路。并针对6种不同的非传统运输问题分析了转化的过程和步骤,为运输问题的研究提供了新的内容. 相似文献
9.
首先对空中加油问题进行了分析,提取了相关性质,在此基础上建立了问题的递推模型.根据该模型,提出了一种启发式搜索算法.该算法计算复杂度低,适用性好.对应于辅机是否可以多次起飞,该算法分为两子算法.对这两种不同情况下的具体问题,设计了相关的优化函数.所有算法都在计算机中运行,并得到了相应结果.值得指出的是,提出的启发式搜索算法十分高效.对于问题1和问题2,该算法所得解是约束条件下的最优调度策略.对于问题3,问题4,问题5,该算法所得解逼近最优调度策略. 相似文献
10.
本文从代数及组合两个方面论证了NP完全问题存在多项式时间算法 .以往利用线性规划 (LP)技术来分析NP完全问题中的TSP问题 ,因其存在子环游问题 ,从而使问题得不到有效解决 .文中发展一分层网络 ,在求解TSP问题时 ,存在另一类(不完全 )子环游问题 .但两模型允许解集的交集避免了两类子环游基本可行解 ,从而使TSP问题可利用LP技术多项式时间内得以解决 ,同时给出了求哈密尔顿回路的多项式标记证明方法 ,开创了NPC问题研究的新局面 . 相似文献
11.
Wenbin Guo 《代数通讯》2013,41(10):4767-4782
This paper answers the open question 12.73 in “Unsolved Problems in Group Theory, The Kourovka Notebook, 1995“. This paper give an example to show that this question has a negative solution, and give a condition under which the conclusion of the question is correct. 相似文献
12.
M. V. Prasolov 《Mathematical Notes》2011,89(3-4):545-554
In [1, Open question 2], the following question was posed: Is the size of the ultra summit set of the conjugacy class of a rigid pseudo-Anosov braid bounded above by a polynomial in the braid length and the number of strands? A negative answer to this question is given. 相似文献
13.
14.
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as lattices of equivalence relations on finite sets closed under certain first-order formulas. We generalize this question to a different collection of first-order formulas, giving examples to demonstrate that our new question is distinct. We then note that every lattice M n can be represented in this new way. 相似文献
15.
We prove that a countably compact space is monotonically retractable if and only if it has a full retractional skeleton. In particular, a compact space is monotonically retractable if and only if it is Corson. This gives an answer to a question of R. Rojas-Hernández and V.V. Tkachuk. Further, we apply this result to characterize retractional skeleton using a topology on the space of continuous functions, answering thus a question of the first author and a related question of W. Kubi?. 相似文献
16.
We consider colourings of Steiner systems S(2,3,v) and S(2,4,v) in which blocks have prescribed colour patterns, as a refinement of the classical weak colourings. The main question studied is, given an integer k, does there exist a colouring of given type using exactly k colours? For several types of colourings, a complete answer to this question is obtained while for other types, partial results are presented. We also discuss the question of the existence of uncolourable systems. 相似文献
17.
D. J. Benson 《Algebras and Representation Theory》1999,2(3):287-294
Let k be a commutative ring of coefficients and G be a finite group. Does there exist a flat k G-module which is projective as a k-module but not as a k G-module? We relate this question to the question of existence of a k-module which is flat and periodic but not projective. For either question to have a positive answer, it is at least necessary to have |k| ≥ ?ω. There can be no such example if k is Noetherian of finite Krull dimension, or if k is perfect. 相似文献
18.
Vasile Lauric 《Czechoslovak Mathematical Journal》2018,68(4):1125-1130
The question whether a hyponormal weighted shift with trace class self-commutator is the compression modulo the Hilbert-Schmidt class of a normal operator, remains open. It is natural to ask whether Putinar’s construction through which he proved that hyponormal operators are subscalar operators provides the answer to the above question. We show that the normal extension provided by Putinar’s theory does not lead to the extension that would provide a positive answer to the question. 相似文献
19.
What is the minimum perimeter of a convex lattice n-gon? This question was answered by Jarník in 1926. We solve the same question, and prove a limit shape result, in the case when perimeter is measured by a (not necessarily symmetric) norm. 相似文献