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


On lower bounds for a class of quadratic 0, 1 programs
Authors:Arjang A Assad  Weixuan Xu
Institution:College of Business and Management, University of Maryland, College Park, MD 20742, USA;Institute of Applied Mathematics, Academia Sinica, Beijing, People''s Republic of China
Abstract:We present a new method of obtaining lower bounds for a class of quadratic 0, 1 programs that includes the quadratic assignment problem. The method generates a monotonic sequence of lower bounds and may be interpreted as a Lagrangean dual ascent procedure. We report on a computational comparison of our bounds with earlier work in 2] based on subgradient techniques.
Keywords:integer quadratic programming  quadratic assignment problem  lower bounding techniques
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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