返回
The column-circular, subsets-selection problem: complexity and solutions
DOI:10.1016/S0305-0548(99)00058-1.png)
摘要
En 中文
In this paper we study the complexity of a new class of a problem that we call the column-circular, subsets-selection problem and we show that, under a special condition, it is a polynomially solvable problem. First, we show that the column-circular set-partitioning, the column-circular set-covering, and the column-circular set-packing problems, among others, are special cases of the problem considered here. Then we present some of its applications. It is also shown that the optimal solution of some of the special cases of the column-circular subsets-selection problem can be obtained by solving a bounded number of totally-unimodular, linear-programming, sub-problems. In the case of column-circular set-partitioning, set-packing and set-packing with under-cover penalties problems, each of these linear sub-problems can be transformed into a shortest path problem. We provide some dynamic programming algorithms to solve the sub-problems of the column-circular subsets-selection problem and its special cases. Finally, a procedure to minimize the number of sub-problems to be solved is described.
Keyword:
routing
scheduling
complexity
set-covering
set-packing
set-partitioning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Finite Element Simulation on Behavior of the High-Strength Concrete Filled High-Strength Square Steel Tube Middle-Long Columns under Axial Compressive Load基于有限元模拟的高强混凝土填充高强方钢管中长柱在轴向压缩荷载作用下的行为研究
没有更多内容

