共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
3.
考虑软容量约束的动态设施选址问题.假设设施的开放费用及连接费用都与时间有关,而且每一个设施均有容量约束.对此问题给出了第一个近似比为6的原始对偶(组合)算法.运行贪婪增加程序后,近似比进一步改进到3.7052. 相似文献
4.
5.
网络G的一个结点v上的一次广播是指从它将一个消息传递给若干相邻结点.所谓f模式广播,是指结点v在一次广播中至多向f(v)个相邻结点传递信息(f为给定的整值函数).假定每一次广播的执行时间为一单位.网络G的广播过程是广播的时间安排,使所有结点均获得消息.最优广播问题是求总时间最少的广播过程.在G是树网络情形,文献中已给出时间界为O(n2)的算法.本文给出线性时间的简捷算法. 相似文献
6.
线性规划流动等值面算法 总被引:5,自引:1,他引:4
对于线性规划问题,本文给出了基于流动等值面的等价模型,提出了一种不可行流动等值面算法.新算法保留了传统单纯形算法的优点并克服了它的不足。初步数值结果表明新算法比传统方法更为有效. 相似文献
7.
APPROXIMATION ALGORITHM FOR MAX-BISECTION PROBLEM WITH THE POSITIVE SEMIDEFINITE RELAXATION 总被引:1,自引:0,他引:1
Da-chuan Xu Ji-ye Han 《计算数学(英文版)》2003,(3)
Using outward rotations, we obtain an approximation algorithm for Max-Bisection problem, i.e., partitioning the vertices of an undirected graph into two blocks of equal cardinality so as to maximize the weights of crossing edges. In many interesting cases, the algorithm performs better than the algorithms of Ye and of Halperin and Zwick. The main tool used to obtain this result is semidefinite programming. 相似文献
8.
9.
10.
This paper presents a smoothing heuristic for an NP-hard combinatorial problem. Starting with a convex Lagrangian relaxation,
a pathfollowing method is applied to obtain good solutions while gradually transforming the relaxed problem into the original
problem formulated with an exact penalty function. Starting points are drawn using different sampling techniques that use
randomization and eigenvectors. The dual point that defines the convex relaxation is computed via eigenvalue optimization
using subgradient techniques.
The proposed method turns out to be competitive with the most recent ones. The idea presented here is generic and can be generalized
to all box-constrained problems where convex Lagrangian relaxation can be applied. Furthermore, to the best of our knowledge,
this is the first time that a Lagrangian heuristic is combined with pathfollowing techniques.
The work was supported by the German Research Foundation (DFG) under grant No 421/2-1. 相似文献
11.
线性规划的支撑方法(二)高学东,武森,李宗元(北京科技大学管理学院,北京100083)6初始支撑可行解的构造6.1初始可行解的构造在研制或设计一种新产品的时候,初始设计往往可以用来帮助构造数学模型,相应的设计向量天虽不一定完全可行,但在某些方面有可能... 相似文献
12.
1引言随机规划中的概率约束问题在工程和管理中有广泛的应用.因为问题中包含非线性的概率约束,它们的求解非常困难.如果目标函数是线性的,问题的求解就比较容易.给出了一个求解随机线性规划概率约束问题的综述.原-对偶算法和切平面算法是比较有效的.在本文中,我们讨论随机凸规划概率约束问题: 相似文献
13.
一种改进的进化规划算法及其收敛性 总被引:16,自引:0,他引:16
1 引 言进化算法是一类借鉴生物界自然选择和自然遗传机制的随机搜索算法 ,主要包括遗传算法 ( genetic algorithms,GA)、进化规划 ( evolutionary programming,EP)和进化策略( evolution strategies,ES) [1 ] .遗传算法 ,进化策略和进化规划分别由 J.H.Holland,I.Rechenberg和 L.J.Fogel提出[2 ,3,4] .这些算法有许多相似性 ,且近年来都被应用于实值连续函数全局优化问题 ,并取得了较好的效果 .一些学者对进化算法的收敛性进行了分析[5,6,7,8] ,但总的说来 ,有关进化算法的理论研究成果目前还不是很多 ,尤其是进化规划和进化策略几… 相似文献
14.
鲁习文 《高校应用数学学报(A辑)》2004,19(Z1):535-542
讨论一般度量空间上带单服务器的极小化总加权完工时间在线Dial-a-Ride问题.通过应用贪婪区间的技巧,提出了一个一般在线随机算法.根据这个算法,对于容量为1或者任意容量的一般度量空间上的在线Dial-a-Ride问题能得到一个竞争比为(2+√2)/ln(1+√2)的在线随机算法,这个算法不仅具有当前最好的竞争比,而且也改进了Krumke等人的结果. 相似文献
15.
We consider the rank-constrained subset selection problem(RCSS):Given a matrix A and integer p≤rank(A),fing the largest submatrix A0 consisting of some colmns of A with rank(A0)=p.The RCSS problem is generally NP-hard.This paper focuses on a divide-and -conquer(DC)algorithm for solving the RCSS problem:Partition the matrix A into several small column blocks:A∏=[A1,…,Ak] with a certain column permutation ∏and decompose p to p1 p2 …pk such that solutions of the RCSS problems for smaller couples form a solution of the original RCSS problem.We show that the optimal solution of the RCSS problem can be found by DC algorithm for eachP≤rank (A),if and only if A is column-partitionable,i.e.,rank(A)=∑i=1^k rank(Ai),Based upon QR decomposition,a fast algorithm for determining the column partition is offered. Our divide-and-conquer algorithm is also quite efficient even A is approximately column-partitionable. 相似文献
16.
Oleg Burdakov Anders Grimvall Oleg Sysoev 《计算数学(英文版)》2006,24(6):771-790
Monotonic regression (MR) is a least distance problem with monotonicity constraints induced by a partiaily ordered data set of observations. In our recent publication [In Ser. Nonconvex Optimization and Its Applications, Springer-Verlag, (2006) 83, pp. 25-33], the Pool-Adjazent-Violators algorithm (PAV) was generalized from completely to partially ordered data sets (posets). The new algorithm, called CPAV, is characterized by the very low computational complexity, which is of second order in the number of observations. It treats the observations in a consecutive order, and it can follow any arbitrarily chosen topological order of the poset of observations. The CPAV algorithm produces a sufficiently accurate solution to the MR problem, but the accuracy depends on the chosen topological order. Here we prove that there exists a topological order for which the resulted CPAV solution is optimal. Furthermore, we present results of extensive numerical experiments, from which we draw conclusions about the most and the least preferable topological orders. 相似文献
17.
In this paper, a new trust region algorithm for minimax optimization problems is proposed, which solves only one quadratic subproblem based on a new approximation model at each iteration. The approach is different from the traditional algorithms that usually require to solve two quadratic subproblems. Moreover, to avoid Maratos effect, the nonmonotone strategy is employed. The analysis shows that, under standard conditions, the algorithm has global and superlinear convergence. Preliminary numerical experiments are conducted to show the efficiency of the new method. 相似文献
18.
19.
本文讨论两台同类平行机排序问题,首先给出Multifit算法在不同迭代初值下的紧界,然后利用一个新设计的对偶贪婪子过程构造出线性时间6/5-复合近似算法。 相似文献