Discrete Optimization最新文献

{"title":"When greedy gives optimal: A unified approach","authors":"Dmitry Rybin","doi":"10.1016/j.disopt.2024.100824","DOIUrl":"10.1016/j.disopt.2024.100824","url":null,"abstract":"<div><p><span>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 </span>packing problems. We also provide connections between packing problems and certain bidirectional capacity installation problems on networks.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"51 ","pages":"Article 100824"},"PeriodicalIF":1.1,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139583667","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":"Parametric matroid interdiction","authors":"Nils Hausbrandt ,&nbsp;Oliver Bachtler ,&nbsp;Stefan Ruzika ,&nbsp;Luca E. Schäfer","doi":"10.1016/j.disopt.2024.100823","DOIUrl":"10.1016/j.disopt.2024.100823","url":null,"abstract":"<div><p>We introduce the parametric<span> matroid one-interdiction problem. Given a matroid, each element of its ground set is associated with a weight that depends linearly on a real parameter from a given parameter interval. The goal is to find, for each parameter value, one element that, when being removed, maximizes the weight of a minimum weight basis. The complexity of this problem can be measured by the number of slope changes of the piecewise linear function mapping the parameter to the weight of the optimal solution of the parametric matroid one-interdiction problem. We provide two polynomial upper bounds as well as a lower bound on the number of these slope changes. Using these, we develop algorithms that require a polynomial number of independence tests and analyse their running time in the special case of graphical matroids.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"51 ","pages":"Article 100823"},"PeriodicalIF":1.1,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139551674","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 polytopes with linear rank with respect to generalizations of the split closure","authors":"Sanjeeb Dash ,&nbsp;Yatharth Dubey","doi":"10.1016/j.disopt.2023.100821","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100821","url":null,"abstract":"<div><p><span>In this paper we study the rank of polytopes contained in the 0-1 cube with respect to </span><span><math><mi>t</mi></math></span>-branch split cuts and <span><math><mi>t</mi></math></span>-dimensional lattice cuts for a fixed positive integer <span><math><mi>t</mi></math></span>. These inequalities are the same as split cuts when <span><math><mrow><mi>t</mi><mo>=</mo><mn>1</mn></mrow></math></span> and generalize split cuts when <span><math><mrow><mi>t</mi><mo>&gt;</mo><mn>1</mn></mrow></math></span>. For polytopes contained in the <span><math><mi>n</mi></math></span>-dimensional 0-1 cube, the work of Balas implies that the split rank can be at most <span><math><mi>n</mi></math></span>, and this bound is tight as Cornuéjols and Li gave an example with split rank <span><math><mi>n</mi></math></span>. All known examples with high split rank – i.e., at least <span><math><mrow><mi>c</mi><mi>n</mi></mrow></math></span> for some positive constant <span><math><mrow><mi>c</mi><mo>&lt;</mo><mn>1</mn></mrow></math></span> – are defined by exponentially many (as a function of <span><math><mi>n</mi></math></span><span>) linear inequalities. For any fixed integer </span><span><math><mrow><mi>t</mi><mo>&gt;</mo><mn>0</mn></mrow></math></span>, we give a family of polytopes contained in <span><math><msup><mrow><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow><mrow><mi>n</mi></mrow></msup></math></span> for sufficiently large <span><math><mi>n</mi></math></span> such that each polytope has empty integer hull, is defined by <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> inequalities, and has rank <span><math><mrow><mi>Ω</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> with respect to <span><math><mi>t</mi></math></span>-dimensional lattice cuts. Therefore the split rank of these polytopes is <span><math><mrow><mi>Ω</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span><span><span>. It was shown earlier that there exist generalized branch-and-bound proofs, with logarithmic depth, of the nonexistence of </span>integer points in these polytopes. Therefore, our lower bound results on split rank show an exponential separation between the depth of branch-and-bound proofs and split rank.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"51 ","pages":"Article 100821"},"PeriodicalIF":1.1,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139487029","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":"Tighter bounds on the minimum broadcast time","authors":"Dag Haugland","doi":"10.1016/j.disopt.2024.100822","DOIUrl":"https://doi.org/10.1016/j.disopt.2024.100822","url":null,"abstract":"<div><p>Given a connected graph and a subset of its vertices referred to as the sources, the minimum broadcast time problem asks for the shortest time necessary for communicating a message from the sources to all other vertices in the graph. Information exchange is possible only between neighbors, and each vertex can transmit the message to at most one neighbor at a time. Since early works on complexity theory, the problem has been known to be NP-hard. Contributions from the current text to the understanding of the minimum broadcast time problem are threefold. Through considerations of the shortest distances between sources and other vertices, a new lower bound on the broadcast time is derived. Analytical expressions of this bound are given in the single source instances of several graph classes. Fast procedures for computing upper bounds are studied next, including both the construction of feasible solutions, and the improvement of existing ones. Finally, with a focus on a new stable-set interpretation of the problem, integer programming formulations are studied, and for their theoretical interest, associated facet-defining valid inequalities are given. The computational performance of the novel methodology is evaluated in numerical experiments applied to standard benchmark instances and to instances larger than those studied in preceding recent works.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"51 ","pages":"Article 100822"},"PeriodicalIF":1.1,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139434347","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":"Characterizing linearizable QAPs by the level-1 reformulation-linearization technique","authors":"Lucas Waddell ,&nbsp;Warren Adams","doi":"10.1016/j.disopt.2023.100812","DOIUrl":"https://doi.org/10.1016/j.disopt.2023.100812","url":null,"abstract":"<div><p>The quadratic assignment problem (QAP) is an extremely challenging NP-hard combinatorial optimization program. Due to its difficulty, a research emphasis has been to identify special cases that are polynomially solvable. Included within this emphasis are instances which are <em>linearizable</em><span><span>; that is, which can be rewritten as a linear assignment problem having the property that the objective function value is preserved at all feasible solutions. Various known sufficient conditions for identifying linearizable instances have been explained in terms of the continuous relaxation of a weakened version of the level-1 reformulation-linearization-technique (RLT) form that does not enforce nonnegativity<span> on a subset of the variables. Also, conditions that are both necessary and sufficient have been given in terms of decompositions of the objective coefficients. The main contribution of this paper is the identification of a relationship between polyhedral theory and linearizability that promotes a novel, yet strikingly simple, necessary and sufficient condition for identifying linearizable instances; specifically, an instance of the QAP is linearizable if and only if the continuous relaxation of the same weakened RLT form is bounded. In addition to providing a novel perspective on the QAP being linearizable, a consequence of this study is that every linearizable instance has an optimal solution to the (polynomially-sized) continuous relaxation of the level-1 RLT form that is binary. The converse, however, is not true so that the continuous relaxation can yield binary optimal solutions to instances of the QAP that are not linearizable. Another consequence follows from our defining a maximal </span></span>linearly independent set of equations in the lifted RLT variable space; we answer a recent open question that the theoretically best possible linearization-based bound cannot improve upon the level-1 RLT form.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"51 ","pages":"Article 100812"},"PeriodicalIF":1.1,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138327976","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":"50 ","pages":"Article 100802"},"PeriodicalIF":1.1,"publicationDate":"2023-11-01","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":"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":"50 ","pages":"Article 100804"},"PeriodicalIF":1.1,"publicationDate":"2023-11-01","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":"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":"&lt;div&gt;&lt;p&gt;Let &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;V&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;&lt;span&gt; be a connected graph, and &lt;/span&gt;&lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;d&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; the degree of vertex &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;V&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;. We define the general &lt;span&gt;&lt;math&gt;&lt;mi&gt;Z&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;-type index of &lt;span&gt;&lt;math&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; as &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;Z&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;β&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mo&gt;∑&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mrow&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;mi&gt;d&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mi&gt;d&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mi&gt;β&lt;/mi&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;span&gt;&lt;math&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;mi&gt;β&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;&lt;span&gt; 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.&lt;/span&gt;&lt;/p&gt;&lt;p&gt;Let &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;π&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; the set of connected graphs with degree sequence &lt;span&gt;&lt;math&gt;&lt;mi&gt;π&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;. In the present paper, under different conditions of &lt;span&gt;&lt;math&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;mi&gt;β&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;, we show that:&lt;/p&gt;&lt;p&gt;&lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;&lt;span&gt; There exists a so-called BFS-graph having extremal &lt;/span&gt;&lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;Z&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;β&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; index in &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;π&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;;&lt;/p&gt;&lt;p&gt;&lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; If &lt;span&gt;&lt;math&gt;&lt;mi&gt;π&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; 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 &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;Z&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;β&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; index in &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;π&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;;&lt;/p&gt;&lt;p&gt;&lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;&lt;span&gt; The so-called majorization theorem of &lt;/span&gt;&lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;Z&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;β&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; holds for trees, unicyclic graphs, and bicyclic graphs.&lt;/p&gt;&lt;p&gt;As applications of the above results, we determine the extremal graphs with maximum &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;Z&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;m","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"50 ","pages":"Article 100808"},"PeriodicalIF":1.1,"publicationDate":"2023-11-01","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":"Packing mixed hyperarborescences","authors":"Zoltán Szigeti","doi":"10.1016/j.disopt.2023.100811","DOIUrl":"10.1016/j.disopt.2023.100811","url":null,"abstract":"<div><p><span>The aim of this paper is twofold. We first provide a new orientation theorem which gives a natural and simple proof of a result of Gao and Yang (2021) on matroid-reachability-based packing of mixed arborescences in mixed graphs by reducing it to the corresponding theorem of Király (2016) on directed graphs. Moreover, we extend another result of Gao and Yang (2021) by providing a new theorem on mixed hypergraphs having a packing of mixed hyperarborescences such that their number is at least </span><span><math><mi>ℓ</mi></math></span> and at most <span><math><msup><mrow><mi>ℓ</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span>, each vertex belongs to exactly <span><math><mi>k</mi></math></span> of them, and each vertex <span><math><mi>v</mi></math></span> is the root of least <span><math><mrow><mi>f</mi><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow></mrow></math></span> and at most <span><math><mrow><mi>g</mi><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow></mrow></math></span> of them.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"50 ","pages":"Article 100811"},"PeriodicalIF":1.1,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136102757","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":"50 ","pages":"Article 100807"},"PeriodicalIF":1.1,"publicationDate":"2023-11-01","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}