Discrete Optimization最新文献

英文中文

Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–723 双层时间最小化运输问题 "更正 [Discrete Optim.] 5 (4) (2008) 714-723

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-11-01 DOI: 10.1016/j.disopt.2024.100863

Sonia , Ankit Khandelwal

This is a corrigendum to our research paper titled “Bilevel time minimizing transportation problem” published in 2008. We deeply regret a minor error in the formulation of an intermediate problem solved as part of the algorithm. The intermediate problem,

{(T P)}_{t}^{T}

, used to iteratively generate the prospective solution pairs, was initially modeled as a linear programming problem. But the correct formulation of its objective function now involves a binary function, thus making it an NP-hard problem. The algorithm is no longer polynomially bound as it involves solving a finite number of mixed 0-1 programming problems. The manuscript’s original contribution stands correct and there is no change to the structure or the accuracy of the algorithm. The changes required to the original paper, due to this error, are presented in this corrigendum.

这是对我们 2008 年发表的题为 "双层时间最小化运输问题 "的研究论文的更正。我们对作为算法一部分的中间问题的表述中的一个小错误深表遗憾。用于迭代生成预期解对的中间问题 (TP)tT 最初被建模为线性规划问题。但其目标函数的正确表述现在涉及二元函数，从而使其成为一个 NP-困难问题。该算法不再具有多项式约束，因为它涉及求解有限数量的混合 0-1 编程问题。手稿的原始贡献是正确的，算法的结构和准确性没有改变。本更正介绍了因这一错误而需要对原论文进行的修改。

引用次数: 0

Anchor-robust project scheduling with non-availability periods 具有不可用时段的锚固型项目进度安排

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-11-01 DOI: 10.1016/j.disopt.2024.100864

Pascale Bendotti , Luca Brunod Indrigo , Philippe Chrétienne , Bruno Escoffier

In large-scale scheduling applications, it is often decisive to find reliable schedules prior to the execution of the project. Most of the time however, data is affected by various sources of uncertainty. Robust optimization is used to overcome this imperfect knowledge. Anchor robustness, as introduced in the literature for processing time uncertainty, makes it possible to guarantee job starting times for a subset of jobs. In this paper, anchor robustness is extended to the case where uncertain non-availability periods must be taken into account. Three problems are considered in the case of budgeted uncertainty: checking that a given subset of jobs is anchored in a given schedule, finding a schedule of minimal makespan in which a given subset of jobs is anchored and finding an anchored subset of maximum weight in a given schedule. Polynomial time algorithms are proposed for the first two problems while an inapproximability result is given for the third one.

在大规模日程安排应用中，在项目执行前找到可靠的日程安排往往具有决定性意义。然而，在大多数情况下，数据会受到各种不确定因素的影响。稳健优化就是用来克服这种不完善的知识。文献中针对处理时间不确定性提出的锚稳健性，可以保证工作子集的工作开始时间。本文将锚稳健性扩展到必须考虑不确定不可用时段的情况。在预算不确定的情况下，本文考虑了三个问题：检查给定计划中是否锚定了给定的工作子集；找到一个最小有效期的计划，其中锚定了给定的工作子集；找到给定计划中权重最大的锚定子集。针对前两个问题提出了多项式时间算法，针对第三个问题给出了不可逼近性结果。

引用次数: 0

Circuit and Graver walks and linear and integer programming 电路和格拉夫行走以及线性和整数编程

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-10-01 DOI: 10.1016/j.disopt.2024.100862

Shmuel Onn

We show that a circuit walk from a given feasible point of a given linear program to an optimal point can be computed in polynomial time using only linear algebra operations and the solution of the single given linear program. We also show that a Graver walk from a given feasible point of a given integer program to an optimal point is polynomial time computable using an integer programming oracle, but without such an oracle, it is hard to compute such a walk even if an optimal solution to the given program is given as well. Combining our oracle algorithm with recent results on sparse integer programming, we also show that Graver walks from any point are polynomial time computable over matrices of bounded tree-depth and subdeterminants.

我们证明，只需使用线性代数运算和单个给定线性规划的解，就能在多项式时间内计算从给定线性规划的给定可行点到最优点的电路行走。我们还证明，从给定整数程序的给定可行点到最优点的 Graver 走法可以用整数编程神谕在多项式时间内计算，但如果没有这样的神谕，即使给定程序的最优解也很难计算这样的走法。结合我们的神谕算法和稀疏整数编程的最新成果，我们还证明了在有界树深度和子决定子矩阵上，从任意点出发的格拉夫行走都是多项式时间可计算的。

引用次数: 0

Approximation schemes for Min-Sum k-Clustering 最小和 k 聚类的近似方案

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-09-17 DOI: 10.1016/j.disopt.2024.100860

Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour

We consider the Min-Sum $k$ -Clustering ( $k$ -MSC) problem. Given a set of points in a metric which is represented by an edge-weighted graph $G = (V, E)$ and a parameter $k$ , the goal is to partition the points $V$ into $k$ clusters such that the sum of distances between all pairs of the points within the same cluster is minimized.

The $k$ -MSC problem is known to be APX-hard on general metrics. The best known approximation algorithms for the problem obtained by Behsaz et al. (2019) achieve an approximation ratio of $O (log | V |)$ in polynomial time for general metrics and an approximation ratio $2 + ϵ$ in quasi-polynomial time for metrics with bounded doubling dimension. No approximation schemes for $k$ -MSC (when $k$ is part of the input) is known for any non-trivial metrics prior to our work. In fact, most of the previous works rely on the simple fact that there is a 2-approximate reduction from $k$ -MSC to the balanced $k$ -median problem and design approximation algorithms for the latter to obtain an approximation for $k$ -MSC.

In this paper, we obtain the first Quasi-Polynomial Time Approximation Schemes (QPTAS) for the problem on metrics induced by graphs of bounded treewidth, graphs of bounded highway dimension, graphs of bounded doubling dimensions (including fixed dimensional Euclidean metrics), and planar and minor-free graphs. We bypass the barrier of 2 for $k$ -MSC by introducing a new clustering problem, which we call min-hub clustering, which is a generalization of balanced $k$ -median and is a trade off between center-based clustering problems (such as balanced $k$ -median) and pair-wise clustering (such as Min-Sum $k$ -clustering). We then show how one can find approximation schemes for Min-hub clustering on certain classes of metrics.

我们考虑的是最小和 k 聚类（k-MSC）问题。给定一个度量中的点集（由边加权图 G=(V,E) 表示）和一个参数 k，目标是将点 V 划分为 k 个聚类，使得同一聚类中所有点对之间的距离之和最小。Behsaz 等人（2019）针对该问题获得的已知最佳近似算法在一般度量条件下的多项式时间内达到了 O(log|V|)的近似率，在具有约束倍维度的度量条件下的准多项式时间内达到了 2+ϵ 的近似率。在我们的研究之前，还没有针对任何非三维度量的 k-MSC 近似方案（当 k 是输入的一部分时）。事实上，之前的大部分研究都依赖于一个简单的事实，即从 k-MSC 到平衡 k-median 问题有一个 2 近似的还原，并为后者设计近似算法，从而得到 k-MSC 的近似值。在本文中，我们首次获得了该问题的准多项式时间近似方案（QPTAS），该方案适用于有界树宽、有界公路维数、有界倍维数（包括固定维数欧几里得度量）的图以及平面图和无次要图所诱导的度量。我们通过引入一个新的聚类问题（我们称之为 min-hub 聚类），绕过了 k-MSC 的 2 的障碍，它是平衡 k-median 的广义化，是基于中心的聚类问题（如平衡 k-median）和成对聚类问题（如 Min-Sum k-clustering）之间的权衡。然后，我们展示了如何在某些度量类别上找到 Min-hub 聚类的近似方案。

{"title":"Approximation schemes for Min-Sum k-Clustering","authors":"Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour","doi":"10.1016/j.disopt.2024.100860","DOIUrl":"10.1016/j.disopt.2024.100860","url":null,"abstract":"<div>We consider the Min-Sum <math><mi>k</mi></math>-Clustering (<math><mi>k</mi></math>-MSC) problem. Given a set of points in a metric which is represented by an edge-weighted graph <math><mrow><mi>G</mi><mo>=</mo><mrow><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></mrow></mrow></math> and a parameter <math><mi>k</mi></math>, the goal is to partition the points <math><mi>V</mi></math> into <math><mi>k</mi></math> clusters such that the sum of distances between all pairs of the points within the same cluster is minimized.The <math><mi>k</mi></math>-MSC problem is known to be APX-hard on general metrics. The best known approximation algorithms for the problem obtained by Behsaz et al. (2019) achieve an approximation ratio of <math><mrow><mi>O</mi><mrow><mo>(</mo><mo>log</mo><mrow><mo>|</mo><mi>V</mi><mo>|</mo></mrow><mo>)</mo></mrow></mrow></math> in polynomial time for general metrics and an approximation ratio <math><mrow><mn>2</mn><mo>+</mo><mi>ϵ</mi></mrow></math> in quasi-polynomial time for metrics with bounded doubling dimension. No approximation schemes for <math><mi>k</mi></math>-MSC (when <math><mi>k</mi></math> is part of the input) is known for any non-trivial metrics prior to our work. In fact, most of the previous works rely on the simple fact that there is a 2-approximate reduction from <math><mi>k</mi></math>-MSC to the balanced <math><mi>k</mi></math>-median problem and design approximation algorithms for the latter to obtain an approximation for <math><mi>k</mi></math>-MSC.In this paper, we obtain the first Quasi-Polynomial Time Approximation Schemes (QPTAS) for the problem on metrics induced by graphs of bounded treewidth, graphs of bounded highway dimension, graphs of bounded doubling dimensions (including fixed dimensional Euclidean metrics), and planar and minor-free graphs. We bypass the barrier of 2 for <math><mi>k</mi></math>-MSC by introducing a new clustering problem, which we call min-hub clustering, which is a generalization of balanced <math><mi>k</mi></math>-median and is a trade off between center-based clustering problems (such as balanced <math><mi>k</mi></math>-median) and pair-wise clustering (such as Min-Sum <math><mi>k</mi></math>-clustering). We then show how one can find approximation schemes for Min-hub clustering on certain classes of metrics.</div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"54 ","pages":"Article 100860"},"PeriodicalIF":0.9,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1572528624000392/pdfft?md5=0298fb9c3c75e407870e412a1aae1a26&pid=1-s2.0-S1572528624000392-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142242680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mostar index and bounded maximum degree 莫斯塔尔指数和有界最大度

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-09-14 DOI: 10.1016/j.disopt.2024.100861

Michael A. Henning , Johannes Pardey , Dieter Rautenbach , Florian Werner

<div>Došlić et al. defined the Mostar index of a graph <math><mi>G</mi></math> as <math><mrow><mi>M</mi><mi>o</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><munder><mrow><mo>∑</mo></mrow><mrow><mi>u</mi><mi>v</mi><mo>∈</mo><mi>E</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></munder><mrow><mo>|</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>G</mi></mrow></msub><mrow><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></mrow><mo>−</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>G</mi></mrow></msub><mrow><mo>(</mo><mi>v</mi><mo>,</mo><mi>u</mi><mo>)</mo></mrow><mo>|</mo></mrow></mrow></math>, where, for an edge <math><mrow><mi>u</mi><mi>v</mi></mrow></math> of <math><mi>G</mi></math>, the term <math><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>G</mi></mrow></msub><mrow><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></mrow></mrow></math> denotes the number of vertices of <math><mi>G</mi></math> that have a smaller distance in <math><mi>G</mi></math> to <math><mi>u</mi></math> than to <math><mi>v</mi></math>. For a graph <math><mi>G</mi></math> of order <math><mi>n</mi></math> and maximum degree at most <math><mi>Δ</mi></math>, we show <math><mrow><mi>M</mi><mi>o</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>≤</mo><mfrac><mrow><mi>Δ</mi></mrow><mrow><mn>2</mn></mrow></mfrac><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>−</mo><mrow><mo>(</mo><mn>1</mn><mo>−</mo><mi>o</mi><mrow><mo>(</mo><mn>1</mn><mo>)</mo></mrow><mo>)</mo></mrow><msub><mrow><mi>c</mi></mrow><mrow><mi>Δ</mi></mrow></msub><mi>n</mi><mo>log</mo><mrow><mo>(</mo><mo>log</mo><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>,</mo></mrow></math> where <math><mrow><msub><mrow><mi>c</mi></mrow><mrow><mi>Δ</mi></mrow></msub><mo>></mo><mn>0</mn></mrow></math> only depends on <math><mi>Δ</mi></math> and the <math><mrow><mi>o</mi><mrow><mo>(</mo><mn>1</mn><mo>)</mo></mrow></mrow></math> term only depends on <math><mi>n</mi></math>. Furthermore, for integers <math><msub><mrow><mi>n</mi></mrow><mrow><mn>0</mn></mrow></msub></math> and <math><mi>Δ</mi></math> at least 3, we show the existence of a <math><mi>Δ</mi></math>-regular graph of order <math><mi>n</mi></math> at least <math><msub><mrow><mi>n</mi></mrow><mrow><mn>0</mn></mrow></msub></math> with <math><mrow><mi>M</mi><mi>o</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>≥</mo><mfrac><mrow><mi>Δ</mi></mrow><mrow><mn>2</mn></mrow></mfrac><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>−</mo><msubsup><mrow><mi>c</mi></mrow><mrow><mi>Δ</mi></mrow><mrow><mo>′</mo></mrow></msubsup><mi>n</mi><mo>log</mo><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>,</mo></mrow></math> where <mat

Došlić 等人将图 G 的莫斯塔尔指数定义为 Mo(G)=∑uv∈E(G)|nG(u,v)-nG(v,u)| 其中，对于 G 的边 uv，nG(u,v) 表示 G 中与 u 的距离小于与 v 的距离的顶点数。对于阶数为 n、最大度数最多为 Δ 的图 G，我们证明了 Mo(G)≤Δ2n2-(1-o(1))cΔnlog(log(n)) ，其中 cΔ>0 只取决于 Δ，而 o(1) 项只取决于 n。此外，对于 n0 和 Δ 至少为 3 的整数，我们证明存在阶数至少为 n0 的 Δ 不规则图，其 Mo(G)≥Δ2n2-cΔ′nlog(n) ，其中 cΔ′>0 只取决于 Δ。

引用次数: 0

Easy and hard separation of sparse and dense odd-set constraints in matching 匹配中稀疏和密集奇集约束的易难分离

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-09-14 DOI: 10.1016/j.disopt.2024.100849

Brady Hunsaker, Craig Tovey

We investigate polytopes intermediate between the fractional matching and the perfect matching polytopes, by imposing a strict subset of the odd-set (blossom) constraints. For sparse constraints, we give a polynomial time separation algorithm if only constraints on all odd sets bounded by a given size (e.g. $\leq 9 + | V | / 6$ ) are present. Our algorithm also solves the more general problem of finding a T-cut subject to upper bounds on the cardinality of its defining node set and on its cost. In contrast, regarding dense constraints, we prove that for every $0 < α \leq \frac{1}{2}$ , it is NP-complete to separate over the class of constraints on odd sets of size $2 ⌊ (1 + α | V |) / 2 ⌋ - 1$ or $\geq α | V |$ .

我们研究了介于分数匹配和完全匹配多边形之间的多边形，方法是施加严格的奇数集（开花）约束子集。对于稀疏约束，如果只存在以给定大小（如 ≤9+|V|/6）为边界的所有奇数集的约束，我们会给出一种多项式时间分离算法。我们的算法还能解决更普遍的问题，即根据定义节点集的万有引力和成本的上限找到 T 切。相反，关于密集约束，我们证明了对于每一个 0<α≤12，在大小为 2⌊(1+α|V|)/2⌋-1或≥α|V|的奇数集合上分离一类约束是 NP-完全的。

{"title":"Easy and hard separation of sparse and dense odd-set constraints in matching","authors":"Brady Hunsaker, Craig Tovey","doi":"10.1016/j.disopt.2024.100849","DOIUrl":"10.1016/j.disopt.2024.100849","url":null,"abstract":"<div>We investigate polytopes intermediate between the fractional matching and the perfect matching polytopes, by imposing a strict subset of the odd-set (blossom) constraints. For sparse constraints, we give a polynomial time separation algorithm if only constraints on all odd sets bounded by a given size (e.g. <math><mrow><mo>≤</mo><mn>9</mn><mo>+</mo><mrow><mo>|</mo><mi>V</mi><mo>|</mo></mrow><mo>/</mo><mn>6</mn></mrow></math>) are present. Our algorithm also solves the more general problem of finding a T-cut subject to upper bounds on the cardinality of its defining node set and on its cost. In contrast, regarding dense constraints, we prove that for every <math><mrow><mn>0</mn><mo><</mo><mi>α</mi><mo>≤</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></mrow></math>, it is NP-complete to separate over the class of constraints on odd sets of size <math><mrow><mn>2</mn><mrow><mo>⌊</mo><mrow><mo>(</mo><mn>1</mn><mo>+</mo><mi>α</mi><mrow><mo>|</mo><mi>V</mi><mo>|</mo></mrow><mo>)</mo></mrow><mo>/</mo><mn>2</mn><mo>⌋</mo></mrow><mo>−</mo><mn>1</mn></mrow></math> or <math><mrow><mo>≥</mo><mi>α</mi><mrow><mo>|</mo><mi>V</mi><mo>|</mo></mrow></mrow></math>.</div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"54 ","pages":"Article 100849"},"PeriodicalIF":0.9,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142228671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Two-set inequalities for the binary knapsack polyhedra 二元节包多面体的两组不等式

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-09-12 DOI: 10.1016/j.disopt.2024.100859

Todd Easton , Jennifer Tryon , Fabio Vitor

This paper presents two-set inequalities, a class of valid inequalities for knapsack and multiple knapsack problems. Two-set inequalities are generated from two arbitrary sets of variables from a knapsack constraint. This class of cutting planes is not a traditional type of lifting since a valid inequality over a restricted space is not required to start. Furthermore, they cannot be derived using any existing lifting technique. The paper presents a quadratic algorithm to efficiently generate many two-set inequalities. Conditions for facet-defining two-set inequalities are also derived. Computational experiments tested these inequalities as pre-processing cuts versus CPLEX, a high-performance mathematical programming solver, at default settings. Overall, two-set inequalities reduced the time to solve some benchmark multiple knapsack instances to up to 80%. Computational results also showed the potential of this new class of cutting planes to solve computationally challenging binary integer programs.

本文介绍了两组不等式，这是一类适用于knapsack和多重knapsack问题的有效不等式。两组不等式由来自一个背包约束的两个任意变量集生成。这一类切割平面不是传统的提升类型，因为开始时并不需要限制空间上的有效不等式。此外，它们无法使用任何现有的提升技术进行推导。本文提出了一种四元算法，可以高效地生成许多二集不等式。同时还推导出了面定义二集不等式的条件。计算实验测试了这些不等式作为预处理切分与 CPLEX（一种高性能数学编程求解器）在默认设置下的对比。总体而言，双集不等式将解决某些基准多重背包实例的时间缩短了 80%。计算结果还显示了这一新型切割平面在解决具有计算挑战性的二进制整数程序方面的潜力。

引用次数: 0

Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations 重新审视二次二元优化问题的一些经典线性化方法以及与约束聚合的联系

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-08-19 DOI: 10.1016/j.disopt.2024.100858

Abraham P. Punnen, Navpreet Kaur Dhanda

In this paper, we examine explicit linearization models associated with the quadratic unconstrained binary optimization problem (QUBO). After reviewing some well-known basic linearization techniques, we present a new explicit linearization technique (PK) for QUBO with interesting properties. In particular, PK yields the same LP relaxation value as that of the standard linearization of QUBO while employing less number of constraints. We then show that using weighted aggregations of selected constraints of the basic linearization models, several new and effective linearization models of QUBO can be developed. Although aggregation of constraints has been studied in the past for solving systems of Diophantine equations in non-negative variables, none of them resulted in practical models, particularly due to the large size of the associated multipliers. For our aggregation based models, the multipliers can be of any positive real number. Moreover, we show that by choosing the multipliers appropriately, the LP relaxations of the resulting linearizations have optimal objective function values identical to that of the corresponding non-aggregated models. Theoretical and experimental comparisons of the new and existing explicit linearization models are also provided. Although our discussions were focused primarily on QUBO, the models and results we obtained extend naturally to the quadratic binary optimization problem with linear constraints.

本文研究了与二次无约束二元优化问题（QUBO）相关的显式线性化模型。在回顾了一些著名的基本线性化技术后，我们提出了一种新的 QUBO 显式线性化技术（PK），它具有有趣的特性。特别是，PK 与 QUBO 标准线性化的 LP 松弛值相同，但采用的约束条件较少。然后我们证明，利用基本线性化模型中选定约束条件的加权聚合，可以开发出几种新的、有效的 QUBO 线性化模型。尽管过去曾有人研究过利用约束条件的聚合来求解非负变量的二叉方程组，但没有一个模型是实用的，特别是由于相关乘数的规模太大。对于我们基于聚合的模型，乘数可以是任何正实数。此外，我们还证明，通过适当选择乘数，所得到的线性化的 LP 放松具有与相应的非聚合模型相同的最佳目标函数值。我们还对新的和现有的显式线性化模型进行了理论和实验比较。虽然我们的讨论主要集中在 QUBO 上，但我们所获得的模型和结果可以自然地扩展到具有线性约束的二次二元优化问题。

{"title":"Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations","authors":"Abraham P. Punnen, Navpreet Kaur Dhanda","doi":"10.1016/j.disopt.2024.100858","DOIUrl":"10.1016/j.disopt.2024.100858","url":null,"abstract":"<div>In this paper, we examine explicit linearization models associated with the quadratic unconstrained binary optimization problem (QUBO). After reviewing some well-known basic linearization techniques, we present a new explicit linearization technique (PK) for QUBO with interesting properties. In particular, PK yields the same LP relaxation value as that of the standard linearization of QUBO while employing less number of constraints. We then show that using weighted aggregations of selected constraints of the basic linearization models, several new and effective linearization models of QUBO can be developed. Although aggregation of constraints has been studied in the past for solving systems of Diophantine equations in non-negative variables, none of them resulted in practical models, particularly due to the large size of the associated multipliers. For our aggregation based models, the multipliers can be of any positive real number. Moreover, we show that by choosing the multipliers appropriately, the LP relaxations of the resulting linearizations have optimal objective function values identical to that of the corresponding non-aggregated models. Theoretical and experimental comparisons of the new and existing explicit linearization models are also provided. Although our discussions were focused primarily on QUBO, the models and results we obtained extend naturally to the quadratic binary optimization problem with linear constraints.</div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"54 ","pages":"Article 100858"},"PeriodicalIF":0.9,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1572528624000379/pdfft?md5=88f5ed7ffa74e8ecf9bb69fd52845013&pid=1-s2.0-S1572528624000379-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142012067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On non-superperfection of edge intersection graphs of paths 论路径边交图的非超完美性

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-08-13 DOI: 10.1016/j.disopt.2024.100857

Victoria Kaial, Hervé Kerivin , Annegret K. Wagler

The routing and spectrum assignment problem in modern flexgrid elastic optical networks asks for assigning to given demands a route in an optical network and a channel within an optical frequency spectrum so that the channels of two demands are disjoint whenever their routes share a link in the optical network. This problem can be modeled in two phases: firstly, a selection of paths in the network and, secondly, an interval coloring problem in the edge intersection graph of these paths. The interval chromatic number equals the smallest size of a spectrum such that a proper interval coloring is possible, the weighted clique number is a natural lower bound. Graphs where both parameters coincide for all possible non-negative integral weights are called superperfect. Therefore, the occurrence of non-superperfect edge intersection graphs of routing paths can provoke the need of larger spectral resources. In this work, we examine the question which minimal non-superperfect graphs can occur in the edge intersection graphs of routing paths in different underlying networks: when the network is a path, a tree, a cycle, or a sparse planar graph with small maximum degree. We show that for any possible network (even if it is restricted to a path) the resulting edge intersection graphs are not necessarily superperfect. We close with a discussion of possible consequences and of some lines of future research.

现代柔性光栅弹性光网络中的路由和频谱分配问题要求为给定需求分配光网络中的一条路由和光频谱中的一个信道，这样，只要两个需求的路由共享光网络中的一个链路，它们的信道就不相交。该问题可分为两个阶段：首先是网络中路径的选择，其次是这些路径的边交图中的区间着色问题。区间色度数等于可以进行适当区间着色的光谱的最小尺寸，加权小块数是一个自然下限。对于所有可能的非负积分权重，两个参数都重合的图被称为超完美图。因此，路由路径的非超完美边交叉图的出现会引起对更大谱资源的需求。在这项工作中，我们研究了在不同的底层网络中，路由路径的边缘交集图中可能出现哪些最小非超完美图的问题：当网络是一条路径、一棵树、一个循环或一个具有较小最大度的稀疏平面图时。我们证明，对于任何可能的网络（即使仅限于路径），所产生的边缘交集图都不一定是超完美的。最后，我们讨论了可能的结果和未来的一些研究方向。

{"title":"On non-superperfection of edge intersection graphs of paths","authors":"Victoria Kaial, Hervé Kerivin , Annegret K. Wagler","doi":"10.1016/j.disopt.2024.100857","DOIUrl":"10.1016/j.disopt.2024.100857","url":null,"abstract":"<div>The routing and spectrum assignment problem in modern flexgrid elastic optical networks asks for assigning to given demands a route in an optical network and a channel within an optical frequency spectrum so that the channels of two demands are disjoint whenever their routes share a link in the optical network. This problem can be modeled in two phases: firstly, a selection of paths in the network and, secondly, an interval coloring problem in the edge intersection graph of these paths. The interval chromatic number equals the smallest size of a spectrum such that a proper interval coloring is possible, the weighted clique number is a natural lower bound. Graphs where both parameters coincide for all possible non-negative integral weights are called superperfect. Therefore, the occurrence of non-superperfect edge intersection graphs of routing paths can provoke the need of larger spectral resources. In this work, we examine the question which minimal non-superperfect graphs can occur in the edge intersection graphs of routing paths in different underlying networks: when the network is a path, a tree, a cycle, or a sparse planar graph with small maximum degree. We show that for any possible network (even if it is restricted to a path) the resulting edge intersection graphs are not necessarily superperfect. We close with a discussion of possible consequences and of some lines of future research.</div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"54 ","pages":"Article 100857"},"PeriodicalIF":0.9,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141979335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The packing number of cubic graphs 立体图形的堆积数

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization

Pub Date : 2024-08-01 DOI: 10.1016/j.disopt.2024.100850

Wayne Goddard , Michael A. Henning

A packing in a graph is a set of vertices that are mutually distance at least 3 apart. By using optimization and linear programming to help analyze the greedy algorithm, we improve on a result of Favaron and show that every connected cubic graph of order $n$ has a packing of size at least $\frac{17}{132} n - O (1)$ .

图中的堆积是指相互距离至少为 3 的顶点集合。通过使用优化和线性规划来帮助分析贪婪算法，我们改进了法瓦隆的一个结果，并证明了每一个有序连通的立方图都有一个大小至少为。

引用次数: 0

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Discrete Optimization

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀