Discrete Optimization最新文献

{"title":"GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat","authors":"Daniel Berend ,&nbsp;Shahar Golan ,&nbsp;Yochai Twitto","doi":"10.1016/j.disopt.2022.100685","DOIUrl":"10.1016/j.disopt.2022.100685","url":null,"abstract":"<div><p>In this paper we present and study a new algorithm for the Maximum Satisfiability (Max Sat) problem. The algorithm is based on the Method of Conditional Expectations (MOCE, also known as Johnson’s Algorithm) and applies a greedy variable ordering to MOCE. Thus, we name it Greedy Order MOCE (GO-MOCE). We also suggest a combination of GO-MOCE with CCLS, a state-of-the-art solver. We refer to this combined solver as GO-MOCE-CCLS.</p><p>We conduct a comprehensive comparative evaluation of GO-MOCE versus MOCE on random instances and on public competition benchmark instances. We show that GO-MOCE reduces the number of unsatisfied clauses by tens of percents, while keeping the runtime almost the same. The worst case time complexity of GO-MOCE is linear. We also show that GO-MOCE-CCLS improves on CCLS consistently by up to about 80%.</p><p>We study the asymptotic performance of GO-MOCE. To this end, we introduce three measures for evaluating the asymptotic performance of algorithms for Max Sat. We point out to further possible improvements of GO-MOCE, based on an empirical study of the main quantities managed by GO-MOCE during its execution.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125991195","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":"Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem","authors":"Olivera Stančić ,&nbsp;Zorica Stanimirović ,&nbsp;Raca Todosijević ,&nbsp;Stefan Mišković","doi":"10.1016/j.disopt.2021.100672","DOIUrl":"10.1016/j.disopt.2021.100672","url":null,"abstract":"<div><p>This paper considers the uncapacitated <span><math><mi>r</mi></math></span>-allocation <span><math><mi>p</mi></math></span><span>-hub maximal covering problem (UrApHMCP), which represents a generalization of the well-known </span><span><math><mi>p</mi></math></span>-hub maximal covering problem, as it allows each non-hub node to send and receive flow via at most <span><math><mi>r</mi></math></span> hubs, <span><math><mrow><mi>r</mi><mo>≤</mo><mi>p</mi></mrow></math></span><span>. Two coverage criteria are considered in UrApHMCP — binary and, for the first time in the literature, partial coverage. Novel mathematical formulations of UrApHMCP for both coverage criteria are proposed. As the considered UrApHMCP is an NP-hard optimization problem, two efficient heuristic methods are proposed as solution approaches. The first one is a variant of General Variable Neighborhood Search (GVNS), and the second one is based on combining a Greedy Randomized Adaptive Search Procedure (GRASP) with Variable Neighborhood Descent (VND), resulting in a hybrid GRASP-VND method. Computational study is performed over the set of CAB and AP benchmark instances with up to 25 and 200 nodes, respectively, on TR instances including 81 nodes, as well as on the challenging USA423 and URAND hub instances with up 423 and 1000 nodes, respectively. Optimal or feasible solutions are obtained by CPLEX solver for instances with up to 50 nodes, while instances of larger dimensions are out of reach for CPLEX solver. On the other hand, both GVNS and GRASP-VND reach optimal solutions or improve lower bounds provided by CPLEX in short CPU times. In addition, both heuristics quickly return solutions on problem instances of large dimensions, thus indicating their potential to solve effectively large, realistic sized problem instances. The conducted non-parametric statistical tests confirm robustness of the proposed GVNS and GRASP-VND and demonstrate that the these two metaheuristics outperform other tested algorithms for UrApHMCP.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121816212","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":"A column generation approach to the discrete barycenter problem","authors":"Steffen Borgwardt ,&nbsp;Stephan Patterson","doi":"10.1016/j.disopt.2021.100674","DOIUrl":"https://doi.org/10.1016/j.disopt.2021.100674","url":null,"abstract":"<div><p><span>The discrete Wasserstein barycenter<span> problem is a minimum-cost mass transport problem for a set of discrete probability measures. Although an exact barycenter is computable through linear programming, the underlying linear program can be extremely large. For worst-case input, a best known linear programming formulation is exponential in the number of variables, but has a low number of constraints, making it an interesting candidate for </span></span>column generation.</p><p>In this paper, we devise and study two column generation strategies: a natural one based on a simplified computation of reduced costs, and one through a Dantzig–Wolfe decomposition. For the latter, we produce efficiently solvable subproblems, namely, a pricing problem in the form of a classical transportation problem. The two strategies begin with an efficient computation of an initial feasible solution. While the structure of the constraints leads to the computation of the reduced costs of all remaining variables for setup, both approaches may outperform a computation using the full program in speed, and dramatically so in memory requirement. In our computational experiments, we exhibit that, depending on the input, either strategy can become a best choice.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91757809","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":"Node-based valid inequalities for the optimal transmission switching problem","authors":"Santanu S. Dey ,&nbsp;Burak Kocuk ,&nbsp;Nicole Redder","doi":"10.1016/j.disopt.2021.100683","DOIUrl":"https://doi.org/10.1016/j.disopt.2021.100683","url":null,"abstract":"<div><p>The benefits of transmission line switching are well-known in terms of reducing operational cost and improving system reliability of power systems. However, finding the optimal power network configuration is a challenging task due to the combinatorial nature of the underlying optimization problem. In this work, we identify a certain “node-based” set that appears as substructure of the optimal transmission switching problem and then conduct a polyhedral study of this set. We construct an extended formulation of the integer hull of this set and present the inequality description of the integer hull in the original space in some cases. These inequalities in the original space can be used as cutting-planes for the transmission line switching problem. Finally, we present the results of our computational experiments using these cutting-planes on difficult test cases from the literature.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91757808","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":"Exact values of defective Ramsey numbers in graph classes","authors":"Yunus Emre Demirci ,&nbsp;Tınaz Ekim ,&nbsp;John Gimbel ,&nbsp;Mehmet Akif Yıldız","doi":"10.1016/j.disopt.2021.100673","DOIUrl":"10.1016/j.disopt.2021.100673","url":null,"abstract":"<div><p>Given a graph <span><math><mi>G</mi></math></span>, a <span><math><mi>k</mi></math></span><em>-sparse</em> <span><math><mi>j</mi></math></span><em>-set</em> is a set of <span><math><mi>j</mi></math></span><span> vertices inducing a subgraph with maximum degree at most </span><span><math><mi>k</mi></math></span>. A <span><math><mi>k</mi></math></span><em>-dense</em> <span><math><mi>i</mi></math></span><em>-set</em> is a set of <span><math><mi>i</mi></math></span> vertices that is <span><math><mi>k</mi></math></span>-sparse in the complement of <span><math><mi>G</mi></math></span>. As a generalization of Ramsey numbers, the <span><math><mi>k</mi></math></span>-defective Ramsey number <span><math><mrow><msubsup><mrow><mi>R</mi></mrow><mrow><mi>k</mi></mrow><mrow><mi>G</mi></mrow></msubsup><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow></mrow></math></span> for the graph class <span><math><mi>G</mi></math></span> is defined as the smallest natural number <span><math><mi>n</mi></math></span> such that all graphs on <span><math><mi>n</mi></math></span> vertices in the class <span><math><mi>G</mi></math></span> have either a <span><math><mi>k</mi></math></span>-dense <span><math><mi>i</mi></math></span>-set or a <span><math><mi>k</mi></math></span>-sparse <span><math><mi>j</mi></math></span>-set. In this paper, we examine <span><math><mrow><msubsup><mrow><mi>R</mi></mrow><mrow><mi>k</mi></mrow><mrow><mi>G</mi></mrow></msubsup><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow></mrow></math></span> where <span><math><mi>G</mi></math></span><span> represents various graph classes. For forests and cographs, we give exact formulas for all defective Ramsey numbers. For cacti, bipartite graphs and split graphs, we derive defective Ramsey numbers in most of the cases and point out open questions, formulated as conjectures if possible.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54146644","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":"Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes","authors":"Arash Haddadan ,&nbsp;Alantha Newman","doi":"10.1016/j.disopt.2021.100659","DOIUrl":"10.1016/j.disopt.2021.100659","url":null,"abstract":"<div><p>We present coloring-based algorithms for tree augmentation and use them to construct convex combinations of 2-edge-connected subgraphs. This classic tool has been applied previously to the problem, but our algorithms illustrate its flexibility, which – in coordination with the choice of spanning tree – can be used to obtain various properties (e.g., 2-vertex connectivity) that are useful in our applications.</p><p><span>We use these coloring algorithms to design approximation algorithms for the 2-edge-connected multigraph problem (2ECM) and the 2-edge-connected spanning subgraph problem (2ECS) on two well-studied types of LP solutions. The first type of points, half-integer square points, belong to a class of </span><em>fundamental extreme points</em>, which exhibit the same integrality gap as the general case. For half-integer square points, the integrality gap for 2ECM is known to be between <span><math><mfrac><mrow><mn>6</mn></mrow><mrow><mn>5</mn></mrow></mfrac></math></span> and <span><math><mfrac><mrow><mn>4</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>. We improve the upper bound to <span><math><mfrac><mrow><mn>9</mn></mrow><mrow><mn>7</mn></mrow></mfrac></math></span>. The second type of points we study are <em>uniform points</em> whose support is a 3-edge-connected graph and each entry is <span><math><mfrac><mrow><mn>2</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>. Although the best-known upper bound on the integrality gap of 2ECS for these points is less than <span><math><mfrac><mrow><mn>4</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>, previous results do not yield an efficient algorithm. We give the first approximation algorithm for 2ECS with ratio below <span><math><mfrac><mrow><mn>4</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span> for this class of points.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.disopt.2021.100659","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127663909","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":"An exact cutting plane method for k-submodular function maximization","authors":"Qimeng Yu,&nbsp;Simge Küçükyavuz","doi":"10.1016/j.disopt.2021.100670","DOIUrl":"10.1016/j.disopt.2021.100670","url":null,"abstract":"<div><p>A natural and important generalization of submodularity – <span><math><mi>k</mi></math></span>-submodularity – applies to set functions with <span><math><mi>k</mi></math></span> arguments and appears in a broad range of applications, such as infrastructure design, machine learning, and healthcare. In this paper, we study maximization problems with <span><math><mi>k</mi></math></span><span>-submodular objective functions. We propose valid linear inequalities, namely the </span><span><math><mi>k</mi></math></span>-submodular inequalities, for the hypograph of any <span><math><mi>k</mi></math></span>-submodular function. This class of inequalities serves as a novel generalization of the well-known submodular inequalities. We show that maximizing a <span><math><mi>k</mi></math></span><span>-submodular function is equivalent to solving a mixed-integer linear program with exponentially many </span><span><math><mi>k</mi></math></span><span>-submodular inequalities. Using this representation in a delayed constraint generation framework, we design the first exact algorithm, that is not a complete enumeration method, to solve general </span><span><math><mi>k</mi></math></span>-submodular maximization problems. Our computational experiments on the multi-type sensor placement problems demonstrate the efficiency of our algorithm in constrained nonlinear <span><math><mi>k</mi></math></span>-submodular maximization problems for which no alternative compact mixed-integer linear formulations are available. The computational experiments show that our algorithm significantly outperforms the only available exact solution method—exhaustive search. Problems that would require over 13 years to solve by exhaustive search can be solved within ten minutes using our method.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.disopt.2021.100670","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54146616","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":"Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets","authors":"Gerardo Berbeglia ,&nbsp;Shant Boodaghians ,&nbsp;Adrian Vetta","doi":"10.1016/j.disopt.2021.100671","DOIUrl":"10.1016/j.disopt.2021.100671","url":null,"abstract":"<div><p>In the storable good monopoly problem, a monopolist sells a storable good by announcing a price in each time period. Each consumer has a unitary demand per time period with an arbitrary valuation. In each period, consumers may buy none, one, or more than one good (in which case the extra goods are stored for future consumption incurring in a linear storage cost). We compare the performance of two important monopoly pricing optimization mechanisms: price optimization using pre-announced prices and price optimization without commitments (contingent mechanism). In pre-announced pricing the prices in each time period are stated in advance; in a price contingent mechanism each price is stated at the start of the time period, and these prices are dependent upon past purchases. We prove that monopolist can earn up to <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mo>log</mo><mi>T</mi><mo>+</mo><mo>log</mo><mi>N</mi><mo>)</mo></mrow></mrow></math></span> times more profit by using a pre-announced pricing mechanism rather than a price contingent mechanism. Here <span><math><mi>T</mi></math></span><span> denotes the number of time periods and </span><span><math><mi>N</mi></math></span> denotes the number of consumers. This bound is tight; examples exist where the monopolist would earn a factor <span><math><mrow><mi>Ω</mi><mrow><mo>(</mo><mo>log</mo><mi>T</mi><mo>+</mo><mo>log</mo><mi>N</mi><mo>)</mo></mrow></mrow></math></span> more by using a pre-announced pricing mechanism.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54146628","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":"Hardness results for Multimarginal Optimal Transport problems","authors":"Jason M. Altschuler,&nbsp;Enric Boix-Adserà","doi":"10.1016/j.disopt.2021.100669","DOIUrl":"10.1016/j.disopt.2021.100669","url":null,"abstract":"<div><p>Multimarginal Optimal Transport (<span><math><mi>MOT</mi></math></span><span>) is the problem of linear programming over joint probability distributions with fixed marginals. A key issue in many applications is the complexity of solving </span><span><math><mi>MOT</mi></math></span><span>: the linear program has exponential size in the number of marginals </span><span><math><mi>k</mi></math></span> and their support sizes <span><math><mi>n</mi></math></span>. A recent line of work has shown that <span><math><mi>MOT</mi></math></span> is <span><math><mrow><mi>poly</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>)</mo></mrow></mrow></math></span>-time solvable for certain families of costs that have <span><math><mrow><mi>poly</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>)</mo></mrow></mrow></math></span><span>-size implicit representations. However, it is unclear what further families of costs this line of algorithmic research can encompass. In order to understand these fundamental limitations, this paper initiates the study of intractability results for </span><span><math><mi>MOT</mi></math></span>.</p><p>Our main technical contribution is developing a toolkit for proving <span><math><mi>NP</mi></math></span>-hardness and inapproximability results for <span><math><mi>MOT</mi></math></span> problems. This toolkit reduces proving intractability of <span><math><mi>MOT</mi></math></span> problems to proving intractability of more amenable <em>discrete</em> optimization problems. We demonstrate this toolkit by using it to establish the intractability of a number of <span><math><mi>MOT</mi></math></span> problems studied in the literature that have resisted previous algorithmic efforts. For instance, we provide evidence that repulsive costs make <span><math><mi>MOT</mi></math></span> intractable by showing that several such problems of interest are <span><math><mi>NP</mi></math></span>-hard to solve—even approximately.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122910312","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":"Arc-routing for winter road maintenance","authors":"Jiří Fink ,&nbsp;Martin Loebl ,&nbsp;Petra Pelikánová","doi":"10.1016/j.disopt.2021.100644","DOIUrl":"https://doi.org/10.1016/j.disopt.2021.100644","url":null,"abstract":"<div><p>The winter road maintenance arc-routing is recognized as a notoriously hard problem not only from the algorithmic point of view. This paper lays down foundations of theoretical understanding of our new winter road maintenance optimization for the Plzeň region of the Czech Republic which has been implemented by the regional authorities since the winter of 2019–20. Our approach is not, contrary to most of existing work, based on the integer and linear programming machinery. We concentrate on studying arc-routing on trees. This is practical since routes of single vehicles can be well represented by trees, and allows algorithms and complementary hardness results. We then extend the approach to the bounded tree width graphs. This leads to considering planar graphs<span><span> which well abstract the realistic road networks. We formalize important aspects of the winter road maintenance problem which were not formalized before, e.g., public complaints. The number of complaints from public against the winter road maintenance is a quantitative measure of the quality of the service which is focused on, e.g., in media or in election campaigns. A fear of ’complaints’ is a fact every optimizer must deal with. Hence, a formal model<span> of public complaints and its inclusion in the optimization is vital. Our formalization of the winter road maintenance is robust in the sense that it relates to well-known extensively studied concepts of </span></span>discrete mathematics like graph cutting and splitting of necklaces.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.disopt.2021.100644","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92219145","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}