首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem
Authors:K C Kiwiel
Institution:(1) Systems Research Institute, Warsaw, Poland
Abstract:We study several variations of the Bitran–Hax variable fixing method for the continuous quadratic knapsack problem. We close the gaps in the convergence analysis of several existing methods and provide more efficient versions. We report encouraging computational results for large-scale problems.
Keywords:Nonlinear programming  Convex programming  Quadratic programming  Separable programming  Singly-constrained quadratic programs
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号