Discrete Optimization最新文献_第4页

Principled deep neural network training through linear programming 原理深度神经网络训练通过线性规划

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-08-01 DOI: 10.1016/j.disopt.2023.100795

Daniel Bienstock , Gonzalo Muñoz , Sebastian Pokutta

引用次数: 17

On the Rényi–Ulam game with restricted size queries 关于限制大小查询的r<s:1> -乌拉姆游戏

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-05-01 DOI: 10.1016/j.disopt.2023.100772

Ádám X. Fraknói , Dávid Á. Márton , Dániel G. Simon , Dániel A. Lenger

{"title":"On the Rényi–Ulam game with restricted size queries","authors":"Ádám X. Fraknói , Dávid Á. Márton , Dániel G. Simon , Dániel A. Lenger","doi":"10.1016/j.disopt.2023.100772","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100772","url":null,"abstract":"<div>We investigate the following version of the well-known Rényi–Ulam game. Two players – the Questioner and the Responder – play against each other. The Responder thinks of a number from the set <math><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>n</mi><mo>}</mo></mrow></math>, and the Questioner has to find this number. To do this, he can ask whether a chosen set of at most <math><mi>k</mi></math> elements contains the thought number. The Responder answers with YES or NO immediately, but during the game, he may lie at most <math><mi>ℓ</mi></math> times. The minimum number of queries needed for the Questioner to surely find the unknown element is denoted by <math><mrow><mi>R</mi><msubsup><mrow><mi>U</mi></mrow><mrow><mi>ℓ</mi></mrow><mrow><mi>k</mi></mrow></msubsup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math>. First, we develop a highly effective tool that we call Convexity Lemma. By using this lemma, we give a general lower bound of <math><mrow><mi>R</mi><msubsup><mrow><mi>U</mi></mrow><mrow><mi>ℓ</mi></mrow><mrow><mi>k</mi></mrow></msubsup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math> and an upper bound which differs from the lower one by at most <math><mrow><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></mrow></math>. We also give its exact value when <math><mi>n</mi></math> is sufficiently large compared to <math><mi>k</mi></math>. With these, we managed to improve and generalize the results obtained by Meng, Lin, and Yang in a 2013 paper about the case <math><mrow><mi>ℓ</mi><mo>=</mo><mn>1</mn></mrow></math>.</div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49716348","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 polytope of binary sequences with bounded variation 具有有界变差的二进制序列的多面体

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-05-01 DOI: 10.1016/j.disopt.2023.100776

Christoph Buchheim, Maja Hügging

{"title":"The polytope of binary sequences with bounded variation","authors":"Christoph Buchheim, Maja Hügging","doi":"10.1016/j.disopt.2023.100776","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100776","url":null,"abstract":"<div>We investigate the problem of optimizing a linear objective function over the set of all binary vectors of length <math><mi>n</mi></math> with bounded variation, where the latter is defined as the number of pairs of consecutive entries with different value. This problem arises naturally in many applications, e.g., in unit commitment problems or when discretizing binary optimal control problems subject to a bounded total variation. We study two variants of the problem. In the first one, the variation of the binary vector is penalized in the objective function, while in the second one, it is bounded by a hard constraint. We show that the first variant is easy to deal with while the second variant turns out to be more complex, but still tractable. For the latter case, we present a complete polyhedral description of the convex hull of feasible solutions by facet-inducing inequalities and devise an exact linear-time separation algorithm. The proof of completeness also yields a new exact primal algorithm with a running time of <math><mrow><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>log</mo><mi>n</mi><mo>)</mo></mrow></mrow></math>, which is significantly faster than the straightforward dynamic programming approach. Finally, we devise a compact extended formulation.A preliminary version of this article has been published in the Proceedings of the 7th International Symposium on Combinatorial Optimization (ISCO 2022) (Buchheim and Hügging, 2022).</div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49809022","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

Minimum gradation in greyscales of graphs 灰度图的最小渐变

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-05-01 DOI: 10.1016/j.disopt.2023.100773

Natalia de Castro , María A. Garrido-Vizuete , Rafael Robles , María Trinidad Villar-Liñán

引用次数: 0

Maximizing the Mostar index for bipartite graphs and split graphs 二部图和分裂图的Mostar指数最大化

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-05-01 DOI: 10.1016/j.disopt.2023.100768

Štefko Miklavič , Johannes Pardey , Dieter Rautenbach , Florian Werner

引用次数: 4

Maximizing the Mostar index for bipartite graphs and split graphs 二部图和分裂图的Mostar指数最大化

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-05-01 DOI: 10.1016/j.disopt.2023.100768

Štefko Miklavič , Johannes Pardey , Dieter Rautenbach , Florian Werner

引用次数: 5

On the Rényi–Ulam game with restricted size queries 关于具有限制大小查询的Rényi–Ulam对策

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-05-01 DOI: 10.1016/j.disopt.2023.100772

Ádám X. Fraknói , Dávid Á. Márton , Dániel G. Simon , Dániel A. Lenger

{"title":"On the Rényi–Ulam game with restricted size queries","authors":"Ádám X. Fraknói , Dávid Á. Márton , Dániel G. Simon , Dániel A. Lenger","doi":"10.1016/j.disopt.2023.100772","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100772","url":null,"abstract":"<div>We investigate the following version of the well-known Rényi–Ulam game. Two players – the Questioner and the Responder – play against each other. The Responder thinks of a number from the set <math><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>n</mi><mo>}</mo></mrow></math>, and the Questioner has to find this number. To do this, he can ask whether a chosen set of at most <math><mi>k</mi></math> elements contains the thought number. The Responder answers with YES or NO immediately, but during the game, he may lie at most <math><mi>ℓ</mi></math> times. The minimum number of queries needed for the Questioner to surely find the unknown element is denoted by <math><mrow><mi>R</mi><msubsup><mrow><mi>U</mi></mrow><mrow><mi>ℓ</mi></mrow><mrow><mi>k</mi></mrow></msubsup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math>. First, we develop a highly effective tool that we call Convexity Lemma. By using this lemma, we give a general lower bound of <math><mrow><mi>R</mi><msubsup><mrow><mi>U</mi></mrow><mrow><mi>ℓ</mi></mrow><mrow><mi>k</mi></mrow></msubsup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math> and an upper bound which differs from the lower one by at most <math><mrow><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></mrow></math>. We also give its exact value when <math><mi>n</mi></math> is sufficiently large compared to <math><mi>k</mi></math>. With these, we managed to improve and generalize the results obtained by Meng, Lin, and Yang in a 2013 paper about the case <math><mrow><mi>ℓ</mi><mo>=</mo><mn>1</mn></mrow></math>.</div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49809018","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

EPTAS for load balancing problem on parallel machines with a non-renewable resource 具有不可再生资源的并行机器负载平衡问题的EPTAS

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-05-01 DOI: 10.1016/j.disopt.2023.100775

G. Jaykrishnan, Asaf Levin

引用次数: 0

Secretary and online matching problems with machine learned advice 秘书和在线匹配问题与机器学习建议

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-05-01 DOI: 10.1016/j.disopt.2023.100778

Antonios Antoniadis , Themis Gouleakis , Pieter Kleer , Pavel Kolev

引用次数: 89

The complexity of 2-vertex-connected orientation in mixed graphs 混合图中2点连通方向的复杂度

IF 1.1 4区数学

Discrete Optimization Pub Date : 2023-05-01 DOI: 10.1016/j.disopt.2023.100774

Florian Hörsch , Zoltán Szigeti

引用次数: 0