Discrete Optimization最新文献

{"title":"Hard problems on box-totally dual integral polyhedra","authors":"Patrick Chervet ,&nbsp;Roland Grappe ,&nbsp;Mathieu Lacroix ,&nbsp;Francesco Pisanu ,&nbsp;Roberto Wolfler Calvo","doi":"10.1016/j.disopt.2023.100810","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100810","url":null,"abstract":"<div><p>In this paper, we study the complexity of some fundamental questions regarding box-totally dual integral (box-TDI) polyhedra. First, although box-TDI polyhedra have strong integrality properties, we prove that Integer Programming over box-TDI polyhedra is NP-complete, that is, finding an integer point optimizing a linear function over a box-TDI polyhedron is hard. Second, we complement the result of Ding et al. (2008) who proved that deciding whether a given system is box-TDI is co-NP-complete: we prove that recognizing whether a polyhedron is box-TDI is co-NP-complete.</p><p>To derive these complexity results, we exhibit new classes of totally equimodular matrices – a generalization of totally unimodular matrices – by characterizing the total equimodularity of incidence matrices of graphs.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92046424","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}

{"title":"Optimal length cutting plane refutations of integer programs","authors":"K. Subramani,&nbsp;Piotr Wojciechowski","doi":"10.1016/j.disopt.2023.100806","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100806","url":null,"abstract":"<div><p><span>In this paper, we discuss the computational complexities of determining optimal length refutations of infeasible integer programs (IPs). We focus on three different types of refutations, namely read-once refutations, tree-like refutations, and dag-like refutations. For each refutation type, we are interested in finding the length of the shortest possible refutation of that type. In the case of this paper, the length of a refutation is equal to the number of inferences in that refutation. The refutations in this paper are also defined by the types of inferences that can be used to derive new constraints. We are interested in refutations with two inference rules. The first rule corresponds to the summation of two constraints and is called the ADD rule. The second rule is the DIV rule which divides a constraint by a positive integer. For integer programs, we study the complexity of approximating the length of the shortest refutation of each type (read-once, tree-like, and dag-like). In this paper, we show that the problem of finding the shortest read-once refutation is </span><strong>NPO PB-complete</strong>. Additionally, we show that the problem of finding the shortest tree-like refutation is <strong>NPO-hard</strong> for IPs. We also show that the problem of finding the shortest dag-like refutation is <strong>NPO-hard</strong> for IPs. Finally, we show that the problems of finding the shortest tree-like and dag-like refutations are in <strong>FPSPACE</strong>.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49712009","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}

{"title":"On cut polytopes and graph minors","authors":"Konstantinos Kaparis ,&nbsp;Adam N. Letchford ,&nbsp;Ioannis Mourtos","doi":"10.1016/j.disopt.2023.100807","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100807","url":null,"abstract":"<div><p>The <em>max-cut problem</em> is a fundamental and much-studied <span><math><mi>NP</mi></math></span><span>-hard combinatorial optimisation problem<span>, with a wide range of applications. Several authors have shown that the max-cut problem can be solved in polynomial time if the underlying graph is free of certain </span></span><em>minors</em><span>. We give a polyhedral counterpart of these results. In particular, we show that, if a family of valid inequalities for the cut polytope satisfies certain conditions, then there is an associated minor-closed family of graphs on which the max-cut problem can be solved efficiently.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49734196","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}

{"title":"On the general Z-type index of connected graphs","authors":"Chaohui Chen ,&nbsp;Wenshui Lin","doi":"10.1016/j.disopt.2023.100808","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100808","url":null,"abstract":"<div><p>Let <span><math><mrow><mi>G</mi><mo>=</mo><mrow><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></mrow></mrow></math></span><span> be a connected graph, and </span><span><math><mrow><mi>d</mi><mrow><mo>(</mo><mi>u</mi><mo>)</mo></mrow></mrow></math></span> the degree of vertex <span><math><mrow><mi>u</mi><mo>∈</mo><mi>V</mi></mrow></math></span>. We define the general <span><math><mi>Z</mi></math></span>-type index of <span><math><mi>G</mi></math></span> as <span><math><mrow><msub><mrow><mi>Z</mi></mrow><mrow><mi>α</mi><mo>,</mo><mi>β</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><msub><mrow><mo>∑</mo></mrow><mrow><mi>u</mi><mi>v</mi><mo>∈</mo><mi>E</mi></mrow></msub><msup><mrow><mrow><mo>[</mo><mi>d</mi><mrow><mo>(</mo><mi>u</mi><mo>)</mo></mrow><mo>+</mo><mi>d</mi><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow><mo>−</mo><mi>β</mi><mo>]</mo></mrow></mrow><mrow><mi>α</mi></mrow></msup></mrow></math></span>, where <span><math><mi>α</mi></math></span> and <span><math><mi>β</mi></math></span><span> are two real numbers. This generalizes several famous topological indices, such as the first and second Zagreb indices, the general sum-connectivity index, the reformulated first Zagreb index, and the general Platt index, which have successful applications in QSPR/QSAR research. Hence, we are able to study these indices in a unified approach.</span></p><p>Let <span><math><mrow><mi>C</mi><mrow><mo>(</mo><mi>π</mi><mo>)</mo></mrow></mrow></math></span> the set of connected graphs with degree sequence <span><math><mi>π</mi></math></span>. In the present paper, under different conditions of <span><math><mi>α</mi></math></span> and <span><math><mi>β</mi></math></span>, we show that:</p><p><span><math><mrow><mo>(</mo><mn>1</mn><mo>)</mo></mrow></math></span><span> There exists a so-called BFS-graph having extremal </span><span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>α</mi><mo>,</mo><mi>β</mi></mrow></msub></math></span> index in <span><math><mrow><mi>C</mi><mrow><mo>(</mo><mi>π</mi><mo>)</mo></mrow></mrow></math></span>;</p><p><span><math><mrow><mo>(</mo><mn>2</mn><mo>)</mo></mrow></math></span> If <span><math><mi>π</mi></math></span> is the degree sequence of a tree, a unicyclic graph, or a bicyclic graph, with minimum degree 1, then there exists a special BFS-graph with extremal <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>α</mi><mo>,</mo><mi>β</mi></mrow></msub></math></span> index in <span><math><mrow><mi>C</mi><mrow><mo>(</mo><mi>π</mi><mo>)</mo></mrow></mrow></math></span>;</p><p><span><math><mrow><mo>(</mo><mn>3</mn><mo>)</mo></mrow></math></span><span> The so-called majorization theorem of </span><span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>α</mi><mo>,</mo><mi>β</mi></mrow></msub></math></span> holds for trees, unicyclic graphs, and bicyclic graphs.</p><p>As applications of the above results, we determine the extremal graphs with maximum <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>α</mi><mo>,</mo><m","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49712365","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}

{"title":"The k-aggregation closure for covering sets","authors":"Haoran Zhu","doi":"10.1016/j.disopt.2023.100805","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100805","url":null,"abstract":"<div><p>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 <span><math><mi>k</mi></math></span><span>-aggregation closure of a covering set is a polyhedron.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49712363","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}

{"title":"Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions","authors":"Rui Chen ,&nbsp;Sanjeeb Dash ,&nbsp;Oktay Günlük","doi":"10.1016/j.disopt.2023.100804","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100804","url":null,"abstract":"<div><p><span>The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set. We study a cardinality constrained version of it with upper and lower bounds on the number of nonzero variables. We call the set of solutions of the standard linearization of this problem a multilinear set with cardinality constraints. We characterize a set of conditions on these multilinear terms (called </span><em>properness</em><span>) and observe that under these conditions the convex hull<span> description of the set is tractable via an extended formulation. We then give an explicit polyhedral description of the convex hull when the multilinear terms have a nested structure. Our description has an exponential number of inequalities which can be separated in polynomial time. Finally, we generalize these inequalities to obtain valid inequalities for the general case.</span></span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49733924","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}

{"title":"More on online weighted edge coloring","authors":"Leah Epstein","doi":"10.1016/j.disopt.2023.100803","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100803","url":null,"abstract":"<div><p><span><span>We revisit online weighted edge coloring. In this problem, weighted edges of a graph are presented one by one, to be colored with positive integers. It is required that for every vertex, all its edges of every common color will have a total weight not exceeding 1. We provide an improved upper bound on the performance of a </span>greedy algorithm First Fit for the case of arbitrary weights, and for the case of weights not exceeding </span><span><math><mfrac><mrow><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math></span>. Here, the meaning of First Fit is that every edge is colored with a color of the smallest index that will keep the coloring valid. This improves the state-of-the-art with respect to online algorithms for this variant of edge coloring. We also show new lower bounds on the performance of any online algorithm with weights in <span><math><mrow><mo>(</mo><mn>0</mn><mo>,</mo><mfrac><mrow><mn>1</mn></mrow><mrow><mi>t</mi></mrow></mfrac><mo>]</mo></mrow></math></span>, for any integer <span><math><mrow><mi>t</mi><mo>≥</mo><mn>2</mn></mrow></math></span>.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49733922","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}

{"title":"Constructing extremal triangle-free graphs using integer programming","authors":"Ali Erdem Banak,&nbsp;Tınaz Ekim,&nbsp;Z. Caner Taşkın","doi":"10.1016/j.disopt.2023.100802","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100802","url":null,"abstract":"<div><p><span>The maximum number of edges in a graph with matching number </span><span><math><mi>m</mi></math></span><span> and maximum degree </span><span><math><mi>d</mi></math></span><span> has been determined in Chvátal and Hanson (1976) and Balachandran and Khare (2009), where some extremal graphs have also been provided. Then, a new question has emerged: how the maximum edge count is affected by forbidding some subgraphs occurring in these extremal graphs? In Ahanjideh et al. (2022), the problem is solved in triangle-free graphs for </span><span><math><mrow><mi>d</mi><mo>≥</mo><mi>m</mi></mrow></math></span>, and for <span><math><mrow><mi>d</mi><mo>&lt;</mo><mi>m</mi></mrow></math></span> with either <span><math><mrow><mi>Z</mi><mrow><mo>(</mo><mi>d</mi><mo>)</mo></mrow><mo>≤</mo><mi>m</mi><mo>&lt;</mo><mn>2</mn><mi>d</mi></mrow></math></span> or <span><math><mrow><mi>d</mi><mo>≤</mo><mn>6</mn></mrow></math></span>, where <span><math><mrow><mi>Z</mi><mrow><mo>(</mo><mi>d</mi><mo>)</mo></mrow></mrow></math></span> is approximately <span><math><mrow><mn>5</mn><mi>d</mi><mo>/</mo><mn>4</mn></mrow></math></span><span>. The authors derived structural properties of triangle-free extremal graphs, which allows us to focus on constructing small extremal components to form an extremal graph. Based on these findings, in this paper, we develop an integer programming formulation for constructing extremal graphs. Since our formulation is highly symmetric, we use our own implementation of Orbital Branching to reduce symmetry. We also implement our integer programming formulation so that the feasible region is restricted iteratively. Using a combination of the two approaches, we expand the solution into </span><span><math><mrow><mi>d</mi><mo>≤</mo><mn>10</mn></mrow></math></span> instead of <span><math><mrow><mi>d</mi><mo>≤</mo><mn>6</mn></mrow></math></span> for <span><math><mrow><mi>m</mi><mo>&gt;</mo><mi>d</mi></mrow></math></span>. Our results endorse the formula for the number of edges in all extremal triangle-free graphs conjectured in Ahanjideh et al. (2022).</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49733923","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}

{"title":"Principled deep neural network training through linear programming","authors":"Daniel Bienstock ,&nbsp;Gonzalo Muñoz ,&nbsp;Sebastian Pokutta","doi":"10.1016/j.disopt.2023.100795","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100795","url":null,"abstract":"<div><p><span>Deep learning<span> has received much attention lately due to the impressive empirical performance achieved by training algorithms. Consequently, a need for a better theoretical understanding of these problems has become more evident and multiple works in recent years have focused on this task. In this work, using a unified framework, we show that there exists a polyhedron that simultaneously encodes, in its facial structure, all possible </span></span>deep neural network<span> training problems that can arise from a given architecture, activation functions, loss function, and sample size. Notably, the size of the polyhedral representation depends only linearly on the sample size, and a better dependency on several other network parameters is unlikely. Using this general result, we compute the size of the polyhedral encoding for commonly used neural network architectures. Our results provide a new perspective on training problems through the lens of polyhedral theory and reveal strong structure arising from these problems.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49715745","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}

{"title":"On the Rényi–Ulam game with restricted size queries","authors":"Ádám X. Fraknói ,&nbsp;Dávid Á. Márton ,&nbsp;Dániel G. Simon ,&nbsp;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><p>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 <span><math><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>n</mi><mo>}</mo></mrow></math></span>, and the Questioner has to find this number. To do this, he can ask whether a chosen set of at most <span><math><mi>k</mi></math></span> elements contains the thought number. The Responder answers with YES or NO immediately, but during the game, he may lie at most <span><math><mi>ℓ</mi></math></span> times. The minimum number of queries needed for the Questioner to surely find the unknown element is denoted by <span><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></span>. First, we develop a highly effective tool that we call Convexity Lemma. By using this lemma, we give a general lower bound of <span><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></span> and an upper bound which differs from the lower one by at most <span><math><mrow><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></mrow></math></span>. We also give its exact value when <span><math><mi>n</mi></math></span> is sufficiently large compared to <span><math><mi>k</mi></math></span>. With these, we managed to improve and generalize the results obtained by Meng, Lin, and Yang in a 2013 paper about the case <span><math><mrow><mi>ℓ</mi><mo>=</mo><mn>1</mn></mrow></math></span>.</p></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}