.png){kind=icon}
返回
On discrete optimization with ordering
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-011-1044-7.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies discrete optimization problems with ordering requirements. These problems are formulated on general discrete sets in which there exists an ordering on their elements together with a cost function that evaluates each element of a given subset depending on its ordering relative to the remaining elements in the set. It is proven that ordered sequences over the original ground set define an independence system. The simplest such ordering problem, that consists of finding the ordered sequence of maximum weight, and its restriction to sets of a fixed cardinality are studied. In both cases, the polyhedral structure of the corresponding feasible sets is analyzed.
Keyword:
Discrete optimization
Ordering problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
分享收藏Stability of obliquely propagating 3D solitons in magnetized plasma with nonthermal distribution
PREAI
分享收藏
分享收藏
查看更多内容