A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint

机译：确定单个约束背包问题的K-最佳解的基于调度代数的方法

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

In this paper, we develop a new and effective schedule algebra based algorithm to determine the K-best solutions of a knapsack problem with a single constraint. Computational experience with this algorithm is also reported and it is shown to dominate both the dynamic programming and branch and bound based procedures when applied to this problem.

机译：在本文中，我们开发了一种新的，有效的基于调度代数的算法，以确定具有单个约束的背包问题的K-最优解。还报道了使用该算法的计算经验，并证明该算法在应用于动态编程以及基于分支和边界的过程中均占主导地位。

著录项

来源
《International Conference on Algorithmic Applications in Management(AAIM 2005); 20050622-25; Xian(CN)》|2005年|P.440-449|共10页
会议地点 Xian(CN)
作者
Subhash C. Sarin; Yuqiang Wang; Dae B. Chang;
展开▼
作者单位

Virginia Polytechnic Institute and State University, Blacksburg VA 24061, USA;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类计算技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. Determining the K-best solutions of knapsack problems [J] . Aline A.S. Leao, Luiz H. Cherri, Marcos N. Arenales Computers & operations research . 2014,第SEPa期

机译：确定背包问题的K-最佳解
2. An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem [J] . Nei Yoshihiro Soma, Nelson Maculan Pesquisa Operacional . 2000,第1期

机译：确定一维背包问题的K-最优解的算法
3. Logic-algebraic method based and constraints programming driven approach to AGVs scheduling [J] . Grzegorz Bocewicz, Irena Bach, Zbigniew A. Banaszak International journal of intelligent information and database systems . 2009,第1期

机译：基于逻辑代数方法和约束编程的AGV调度方法
4. A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint [C] . Subhash C. Sarin, Yuqiang Wang, Dae B. Chang International Conference on Algorithmic Applications in Management . 2005

机译：基于计划代数的方法，以确定单个约束的背包问题的K-Best解决方案
5. A solution approach for the single machine Early/Tardy scheduling problems [D] . Khader, Maher 2008

机译：单机提前/迟到调度问题的解决方案
6. Performance Analysis of Positioning Solution Using Low-Cost Single-Frequency U-Blox Receiver Based on Baseline Length Constraint [O] . Liguo Lu, Liye Ma, Tangting Wu, 2019

机译：基于基线长度约束的低成本单频U-Blox接收机定位解决方案性能分析
7. An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem [O] . Horacio Hideki Yanasse, Nei Yoshihiro Soma, Nelson Maculan 2000

机译：一种确定一维背包问题的K-最佳解的算法
8. Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach [R] . Chien, S., Gratch, J. 1994

机译：为调度问题提出令人满意的解决方案：一种迭代约束松弛方法

A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint

摘要

著录项

相似文献

相关主题

期刊订阅