Discrete Optimization最新文献

{"title":"Packing strong subgraph in digraphs","authors":"Yuefang Sun ,&nbsp;Gregory Gutin ,&nbsp;Xiaoyan Zhang","doi":"10.1016/j.disopt.2022.100745","DOIUrl":"https://doi.org/10.1016/j.disopt.2022.100745","url":null,"abstract":"<div><p>In this paper, we study two types of strong subgraph packing problems in digraphs, including internally disjoint strong subgraph packing problem and arc-disjoint strong subgraph packing problem. These problems can be viewed as generalizations of the famous Steiner tree packing problem and are closely related to the strong arc decomposition problem. We first prove the NP-completeness for the internally disjoint strong subgraph packing problem restricted to symmetric digraphs and Eulerian digraphs. Then we get inapproximability results for the arc-disjoint strong subgraph packing problem and the internally disjoint strong subgraph packing problem. Finally we study the arc-disjoint strong subgraph packing problem restricted to digraph compositions and obtain some algorithmic results by utilizing the structural properties.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92079886","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":"Finding the dimension of a non-empty orthogonal array polytope","authors":"Dursun A. Bulutoglu","doi":"10.1016/j.disopt.2022.100727","DOIUrl":"10.1016/j.disopt.2022.100727","url":null,"abstract":"<div><p><span><span>By using representation theory, we reduce the size of the set of possible values for the dimension of the convex hull of all feasible points of an </span>orthogonal array<span><span> (OA) defining integer linear description (ILD). Our results address the conjecture that if this polytope is non-empty, then it is full-dimensional within the </span>affine space where all the feasible points of the ILD’s linear description (LD) relaxation lie, raised by Appa et al. (2006). In particular, our theoretical results provide a sufficient condition for this polytope to be full-dimensional within the LD relaxation affine space when it is non-empty. This sufficient condition implies all the known non-trivial values of the dimension of the </span></span><span><math><mrow><mo>(</mo><mi>k</mi><mo>,</mo><mi>s</mi><mo>)</mo></mrow></math></span> assignment polytope. However, our results suggest that the conjecture mentioned above may not be true. More generally, we provide previously unknown restrictions on the feasible values of the dimension of the convex hull of all feasible points of our OA defining ILD. We also determine all possible corresponding sets of equality constraints up to equivalence that can potentially be implied by the integrality constraints of this ILD. Moreover, we find additional restrictions on the dimension of the convex hull of all feasible points, and larger sets of corresponding equality constraints for the <span><math><mrow><mi>n</mi><mo>=</mo><mn>2</mn></mrow></math></span> and even <span><math><mi>s</mi></math></span> cases. Each of these cases possesses symmetries that do not necessarily exist in the <span><math><mrow><mn>3</mn><mo>≤</mo><mi>n</mi></mrow></math></span> or odd <span><math><mi>s</mi></math></span> cases. Finally, we discuss how to decrease the number of possible values for the dimension of the convex hull of all feasible points of an arbitrary ILD as well as generate sets of corresponding equality constraints with the zero right hand side. These are the only sets of zero right hand side equality constraints up to equivalence that can potentially be implied by the integrality constraints of the ILD.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130082468","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 analysis of optimization problems in arc-dependent networks","authors":"P. Wojciechowski ,&nbsp;M. Williamson ,&nbsp;K. Subramani","doi":"10.1016/j.disopt.2022.100729","DOIUrl":"https://doi.org/10.1016/j.disopt.2022.100729","url":null,"abstract":"<div><p>This paper is concerned with the design and analysis of algorithms for optimization problems in arc-dependent networks. A network is said to be arc-dependent if the cost of an arc <span><math><mi>a</mi></math></span> depends upon the arc taken to enter <span><math><mi>a</mi></math></span><span>. These networks are fundamentally different from traditional networks in which the cost associated with an arc is a fixed constant and part of the input. We first study the arc-dependent shortest path (ADSP) problem, which is also known as the suffix-1 path-dependent shortest path problem in the literature. This problem has a polynomial time solution if the shortest paths are not required to be simple. The ADSP problem finds applications in a number of domains, including highway engineering, turn penalties and prohibitions, and fare rebates. In this paper, we are interested in the ADSP problem when restricted to simple paths. We call this restricted version the simple arc-dependent shortest path (SADSP) problem. We show that the SADSP problem is </span><strong>NP-complete</strong>. We present inapproximability results and an exact exponential algorithm for this problem. We also extend our results for the longest path problem in arc-dependent networks. Additionally, we explore the problem of detecting negative cycles in arc-dependent networks and discuss its computational complexity. Our results include variants of the negative cycle detection problem such as longest, shortest, heaviest, and lightest negative simple cycles.<span>²</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92257291","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":"Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan","authors":"Cheng He,&nbsp;Jing Wu,&nbsp;Hao Lin","doi":"10.1016/j.disopt.2022.100698","DOIUrl":"10.1016/j.disopt.2022.100698","url":null,"abstract":"<div><p>This paper considers the bounded parallel-batching scheduling with two agents to minimize maximum cost of agent <span><math><mi>A</mi></math></span> and makespan of agent <span><math><mi>B</mi></math></span> simultaneously, in which all jobs of agent <span><math><mi>A</mi></math></span><span> have equal processing time, the jobs from different agents can be processed in a common batch and the cost function of each agent is only determined by its own jobs. In the paper, we present a polynomial-time algorithm to generate all Pareto optimal points for the problem and determine a corresponding Pareto optimal schedule for each Pareto optimal point.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125971798","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 packing time-respecting arborescences","authors":"Romain Chapoullié ,&nbsp;Zoltán Szigeti","doi":"10.1016/j.disopt.2022.100702","DOIUrl":"https://doi.org/10.1016/j.disopt.2022.100702","url":null,"abstract":"<div><p>We present a slight generalization of the result of Kamiyama and Kawase (2015) on packing time-respecting arborescences in acyclic pre-flow temporal networks. Our main contribution is to provide the first results on packing time-respecting arborescences in non-acyclic temporal networks. As negative results, we prove the NP-completeness of the decision problem of the existence of 2 arc-disjoint spanning time-respecting arborescences and of a related problem proposed in this paper.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137125618","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 length of L-Grundy sequences","authors":"Rebekah Herrman ,&nbsp;Stephen G.Z. Smith","doi":"10.1016/j.disopt.2022.100725","DOIUrl":"10.1016/j.disopt.2022.100725","url":null,"abstract":"<div><p>An L-sequence of a graph <span><math><mi>G</mi></math></span> is a sequence of distinct vertices <span><math><mrow><mi>S</mi><mo>=</mo><mrow><mo>(</mo><msub><mrow><mi>v</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>)</mo></mrow></mrow></math></span> such that <span><math><mrow><mi>N</mi><mrow><mo>[</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>]</mo></mrow><mo>∖</mo><msubsup><mrow><mo>∪</mo></mrow><mrow><mi>j</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>i</mi><mo>−</mo><mn>1</mn></mrow></msubsup><mi>N</mi><mrow><mo>(</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>)</mo></mrow><mo>≠</mo><mo>0̸</mo></mrow></math></span>. The length of a longest L-sequence is called the L-Grundy domination number, denoted <span><math><mrow><msubsup><mrow><mi>γ</mi></mrow><mrow><mi>g</mi><mi>r</mi></mrow><mrow><mi>L</mi></mrow></msubsup><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span>. In this paper, we prove <span><math><mrow><msubsup><mrow><mi>γ</mi></mrow><mrow><mi>g</mi><mi>r</mi></mrow><mrow><mi>L</mi></mrow></msubsup><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>≤</mo><mi>n</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>−</mo><mi>δ</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>+</mo><mn>1</mn></mrow></math></span>, which was conjectured by Brešar, Gologranc, Henning, and Kos. We also prove some initial results about characteristics of <span><math><mi>n</mi></math></span>-vertex graphs satisfying <span><math><mrow><msubsup><mrow><mi>γ</mi></mrow><mrow><mi>g</mi><mi>r</mi></mrow><mrow><mi>L</mi></mrow></msubsup><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><mi>n</mi></mrow></math></span>.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121208941","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":"LP-based approximation for uniform capacitated facility location problem","authors":"Sapna Grover ,&nbsp;Neelima Gupta ,&nbsp;Samir Khuller","doi":"10.1016/j.disopt.2022.100723","DOIUrl":"10.1016/j.disopt.2022.100723","url":null,"abstract":"<div><p><span><span>In this paper, we study uniform hard capacitated facility location problem. The standard LP for the problem is known to have an unbounded integrality gap. We present constant factor approximation by </span>rounding a solution to the standard LP with a slight </span><span><math><mrow><mo>(</mo><mn>1</mn><mo>+</mo><mi>ϵ</mi><mo>)</mo></mrow></math></span> violation in the capacities.</p><p>Our result shows that the standard LP is not too bad.</p><p>Our algorithm is simple and more efficient as compared to the strengthened LP-based true approximation that uses the inefficient ellipsoid method with a separation oracle. True approximations are also known for the problem using local search techniques that suffer from the problem of convergence. Moreover, solutions based on standard LP are easier to integrate with other LP-based algorithms.</p><p>The result is also extended to give the first approximation for uniform hard capacitated <span><math><mi>k</mi></math></span>-facility location problem violating the capacities by a factor of <span><math><mrow><mo>(</mo><mn>1</mn><mo>+</mo><mi>ϵ</mi><mo>)</mo></mrow></math></span> and breaking the barrier of 2 in capacity violation. The result violates the cardinality by a factor of <span><math><mfrac><mrow><mn>2</mn></mrow><mrow><mn>1</mn><mo>+</mo><mi>ϵ</mi></mrow></mfrac></math></span>.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131270426","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 theoretical justification of the set covering greedy heuristic of Caprara et al.","authors":"Torbjörn Larsson,&nbsp;Nils-Hassan Quttineh","doi":"10.1016/j.disopt.2022.100700","DOIUrl":"10.1016/j.disopt.2022.100700","url":null,"abstract":"<div><p>Large scale set covering problems have often been approached by constructive greedy heuristics, and much research has been devoted to the design and evaluation of various greedy criteria for such heuristics. A criterion proposed by Caprara et al. (1999) is based on reduced costs with respect to the yet unfulfilled constraints, and the resulting greedy heuristic is reported to be superior to those based on original costs or ordinary reduced costs.</p><p>We give a theoretical justification of the greedy criterion proposed by Caprara et al. by deriving it from a global optimality condition for general non-convex optimisation problems. It is shown that this criterion is in fact greedy with respect to incremental contributions to a quantity which at termination coincides with the deviation between a Lagrangian dual bound and the objective value of the feasible solution found.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1572528622000135/pdfft?md5=c47eb15145df224a815aa72a5c23497a&pid=1-s2.0-S1572528622000135-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123680892","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}

{"title":"The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem","authors":"Mauro Henrique Mulati ,&nbsp;Ricardo Fukasawa ,&nbsp;Flávio Keidi Miyazawa","doi":"10.1016/j.disopt.2022.100710","DOIUrl":"10.1016/j.disopt.2022.100710","url":null,"abstract":"<div><p><span>The Capacitated Vehicle Routing Problem (</span><span>CVRP</span>) consists of finding the cheapest way to serve a set of customers with a fleet of vehicles of a given capacity. While serving a particular customer, each vehicle picks up its demand and carries its weight throughout the rest of its route. While costs in the classical <span>CVRP</span> are measured in terms of a given arc distance, the Cumulative Vehicle Routing Problem (<span>CmVRP</span>) is a variant of the problem that aims to minimize total energy consumption. Each arc’s energy consumption is defined as the product of the arc distance by the weight accumulated since the beginning of the route.</p><p>The purpose of this work is to propose several different formulations for the <span>CmVRP</span> and to study their Linear Programming (LP) relaxations. In particular, the goal is to study formulations based on combining an arc-item concept (that keeps track of whether a given customer has already been visited when traversing a specific arc) with another formulation from the recent literature, the Arc-Load formulation (that determines how much load goes through an arc).</p><p>Both formulations have been studied independently before – the Arc-Item is very similar to a multi-commodity-flow formulation in Letchford and Salazar-González (2015) and the Arc-Load formulation has been studied in Fukasawa et al. (2016) – and their LP relaxations are incomparable. Nonetheless, we show that a formulation combining the two (called Arc-Item-Load) may lead to a significantly stronger LP relaxation, thereby indicating that the two formulations capture complementary aspects of the problem. In addition, we study how set partitioning based formulations can be combined with these formulations. We present computational experiments on several well-known benchmark instances that highlight the advantages and drawbacks of the LP relaxation of each formulation and point to potential avenues of future research.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124959123","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 cut-and-branch algorithm for the Quadratic Knapsack Problem","authors":"Franklin Djeumou Fomeni ,&nbsp;Konstantinos Kaparis ,&nbsp;Adam N. Letchford","doi":"10.1016/j.disopt.2020.100579","DOIUrl":"10.1016/j.disopt.2020.100579","url":null,"abstract":"<div><p>The <em>Quadratic Knapsack Problem</em> (QKP) is a well-known <span><math><mi>NP</mi></math></span><span>-hard combinatorial optimisation problem, with many practical applications. We present a ‘cut-and-branch’ algorithm for the QKP, in which a cutting-plane phase is followed by a branch-and-bound phase. The cutting-plane phase is more sophisticated than the existing ones in the literature, incorporating several classes of cutting planes, two primal heuristics, and several rules for eliminating variables and constraints. Computational results show that the algorithm is competitive.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.disopt.2020.100579","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115826892","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}