首页> 外文OA文献 >A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming

【2h】

A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming

机译：基于线性规划的下界二次赋值问题的分支定界算法

页面导航

著录项
相似文献
相关主题

著录项

作者
K. G. Ramakrishnan; M. G. C. Resende; P.M. Pardalos;
展开▼
作者单位

展开▼
年度 1995
总页数
原文格式 PDF
正文语种
中图分类
入库时间 2022-08-20 20:57:22

相似文献

外文文献
中文文献
专利

1. Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem [J] . Guimaraes Dilson Almeida, da Cunha Alexandre Salles, Pereira Dilson Lucas European Journal of Operational Research . 2020,第1期

机译：SemideFinite编程下限和分支和绑定算法，用于二次最小生成树问题
2. Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem [J] . Journal of Virological Methods . 2020,第期

机译：SemideFinite编程下限和分支和绑定算法，用于二次最小生成树问题
3. COMPUTING LOWER BOUNDS FOR THE QUADRATIC ASSIGNMENT PROBLEM WITH AN INTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING [J] . Resende MGC., Drezner Z., Ramakrishnan KG. Operations Research: The Journal of the Operations Research Society of America . 1995,第5期

机译：用线性规划的内点算法计算二次赋值问题的下界
4. A Fast Algorithm for Linearly Constrained Quadratic Programming Problems with Lower and Upper Bounds [C] . Yanwu Liu, Zhongzhen Zhang MultiMedia and Information Technology, 2008. MMIT '08 . 2008

机译：具有上下界的线性约束二次规划问题的快速算法
5. Improved branch and bound algorithms for integer programming. [D] . Borchers, Brian Todd. 1992

机译：改进的用于整数编程的分支定界算法。
6. A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming [O] . Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, 2021

机译：基于人工神经网络和整数规划的有界分支高度的无循环化学化合物推断的新方法
7. Implementation Of A Variance Reduction Based Lower Bound In A Branch And Bound Algorithm For The Quadratic Assignment Problem [O] . P.M. Pardalos, K. G. Ramakrishnan, M.G.C. Resende, 1997

机译：二次赋值问题的分支定界算法中基于方差降低的下界的实现
8. A Branch and Bound Based Heuristic for Solving the Quadratic Assignment Problem [R] . Bazaraa, M. S., Kirca, O. 1981

机译：基于分支定界的启发式求解二次分配问题

A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming

著录项

相似文献

相关主题

期刊订阅