首页> 外文OA文献 >Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems

【2h】

Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems

机译：带有间隔（多选择）背包问题的改进的多单位拍卖清算算法

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Yunhong Zhou;
展开▼
作者单位

展开▼
年度 2008
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. AN IMPROVED BINARY SEARCH ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK PROBLEM [J] . He Cheng, Leung Joseph Y-T., Lee Kangbok, RAIRO Operation Research . 2016,第4a5期

机译：多选择背包问题的改进二元搜索算法
2. Exact Solution Algorithms for Multi-dimensional Multiple-choice Knapsack Problems [J] . Farhad Ghassemi-Tari, Hamed Hendizadeh, Gary L. Hogg British Journal of Applied Science and Technology . 2018,第5期

机译：多维多项选择背包问题的精确解算法
3. Hybrid algorithms for the Multiple-choice Multi-dimensional Knapsack Problem [J] . Nawal Cherfi, Mhand Hifi International Journal of Operational Research . 2009,第1期

机译：多项选择多维背包问题的混合算法
4. Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems [C] . Yunhong Zhou Algorithms and Computation; Lecture Notes in Computer Science; 4288 . 2006

机译：带有间隔（多选择）背包问题的改进的多单位拍卖清算算法
5. Analysis of multi-attribute multi-unit procurement auctions and capacity-constrained sequential auctions [D] . Zhang, Zhuoxiu 2009

机译：多属性多单位采购拍卖和容量受限的顺序拍卖分析
6. An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems [O] . Yanhong Feng, Gai-Ge Wang, Qingjiang Feng, 2014

机译：一种改进的改进蛙跳算法的混合杜鹃搜索算法解决0-1背包问题
7. Optimal clearing algorithms for multi-unit single item and multi-unit combinatorial auctions with demand/supply function bidding [O] . Dang V.D., Jennings N. R. 2003

机译：具有需求/供应函数投标的多单元单项和多单元组合拍卖的最优清算算法

Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems

著录项

引文网络

相似文献

相关主题

期刊订阅