When greedy gives optimal: A unified approach

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED Discrete Optimization Pub Date : 2024-02-01 DOI:10.1016/j.disopt.2024.100824

Dmitry Rybin

引用次数: 0

Abstract

We present necessary and sufficient conditions when a certain greedy object selection algorithm gives optimal results. Our approach covers known results for the Unbounded Knapsack Problem and Change Making Problem and gives new theoretical results for a variety of packing problems. We also provide connections between packing problems and certain bidirectional capacity installation problems on networks.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

当贪婪产生最佳结果时：统一方法

我们提出了某种贪婪对象选择算法给出最优结果的必要条件和充分条件。我们的方法涵盖了无界可纳包问题和变更问题的已知结果，并给出了各种打包问题的新理论结果。我们还提供了打包问题与网络上某些双向容量安装问题之间的联系。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Discrete Optimization 管理科学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.

期刊最新文献

Anchor-robust project scheduling with non-availability periods Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–723 Circuit and Graver walks and linear and integer programming Approximation schemes for Min-Sum k-Clustering Easy and hard separation of sparse and dense odd-set constraints in matching