位置：成果数据库 > 期刊 > 期刊详情页
AN EFFICIENT LAGRANGIAN SMOOTHING HEURISTIC FOR MAX-CUT
  • ISSN号：0019-5588
  • 期刊名称：Indian Journal of Pure and Applied Mathematics
  • 时间：2010.10.10
  • 页码：683-700
  • 相关项目：非凸二次优化的一些理论与应用
作者： Xia, Yong|Xu, Zi|
同期刊论文项目
非凸二次优化的一些理论与应用
期刊论文 14
同项目期刊论文
A new penalty parameter for linearly constrained 0-1 quadratic programming problems
Two-step version of fixed point continuation method for sparse reconstruction
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
ON THE REDUCTION OF DUALITY GAP IN BOX CONSTRAINED NONCONVEX QUADRATIC PROGRAM
NEW RESULTS ON SEMIDEFINITE BOUNDS FOR l(1)-CONSTRAINED NONCONVEX QUADRATIC OPTIMIZATION
Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
Two-point step-size iterative soft-thresholding method for sparse reconstruction
Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
CONVEX HULL OF THE ORTHOGONAL SIMILARITY SET WITH APPLICATIONS IN QUADRATIC ASSIGNMENT PROBLEMS
New semidefinite programming relaxations for box constrained quadratic program
求解位姿估计问题的对偶方法