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


Max–max,max–min,min–max and min–min knapsack problems with a parametric constraint
Authors:Halman  Nir  Kovalyov  Mikhail Y  Quilliot  Alain
Institution:1.Bar-Ilan University, Ramat Gan, Israel
;2.United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus
;3.LIMOS, UMR CNRS 6158, Bat. ISIMA, Université Blaise Pascal, Campus des Cézeaux, BP 125, 63173, Aubiere, France
;
Abstract:4OR - Max–max, max–min, min–max and min–min optimization problems with a knapsack-type constraint containing a single numerical parameter are studied. The goal is to present...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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