The k-aggregation closure for covering sets

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED Discrete Optimization Pub Date : 2023-09-26 DOI:10.1016/j.disopt.2023.100805

Haoran Zhu

引用次数: 0

Abstract

In this paper, we will answer a more general version of one of the questions proposed by Bodur et al. (2017). Specifically, we show that the $k$ -aggregation closure of a covering set is a polyhedron.

查看原文

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

本刊更多论文

覆盖集的k聚集闭包

在本文中，我们将回答Bodur等人提出的一个问题的更一般的版本。（2017）。具体地说，我们证明了覆盖集的k-聚集闭包是一个多面体。

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

求助全文

约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