FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3134880487> ?p ?o ?g. }

• W3134880487 abstract "We consider a two-player interdiction problem staged over a graph where the attacker’s objective is to minimize the cost of removing edges from the graph so that the defender’s objective, that is, the weight of a minimum spanning tree in the residual graph, is increased up to a predefined level r. Standard approaches for graph interdiction frame this type of problems as bilevel formulations, which are commonly solved by replacing the inner problem by its dual to produce a single-level reformulation. In this paper, we study an alternative integer program derived directly from the attacker’s solution space and show that this formulation yields a stronger linear relaxation than the bilevel counterpart. Furthermore, we analyze the convex hull of the feasible solutions of the problem and identify several families of facet-defining inequalities that can be used to strengthen this integer program. We then proceed by introducing a different formulation defined by a set of so-called supervalid inequalities that may exclude feasible solutions, albeit solutions whose objective value is not better than that of an edge cut of minimum cost. We discuss several computational aspects required for an efficient implementation of the proposed approaches. Finally, we perform an extensive set of computational experiments to test the quality of these formulations, analyzing and comparing the benefits of each model, as well as identifying further enhancements. Summary of Contribution: Network interdiction has received significant attention over the last couple of decades, with a notable peak of interest in recent years. This paper provides an interesting balance between the theoretical and computational aspects of solving a challenging network interdiction problem via integer programming. We present several technical developments, including a detailed study of the problem's solution space, multiple formulations, and a polyhedral analysis of the convex hull of feasible solutions. We then analyze the results of an extensive set of computational experiments that were used to validate the effectiveness of the different methods we developed in this paper." @default.
• W3134880487 created "2021-03-15" @default.
• W3134880487 creator A5032371377 @default.
• W3134880487 creator A5051343300 @default.
• W3134880487 creator A5064878667 @default.
• W3134880487 date "2021-03-04" @default.
• W3134880487 modified "2023-09-27" @default.
• W3134880487 title "Integer Programming Formulations for Minimum Spanning Tree Interdiction" @default.
• W3134880487 cites W1486447486 @default.
• W3134880487 cites W1511028394 @default.
• W3134880487 cites W1558071713 @default.
• W3134880487 cites W1576317141 @default.
• W3134880487 cites W1949782199 @default.
• W3134880487 cites W1958202723 @default.
• W3134880487 cites W1975492545 @default.
• W3134880487 cites W1982512167 @default.
• W3134880487 cites W1986261983 @default.
• W3134880487 cites W1987468019 @default.
• W3134880487 cites W1988871016 @default.
• W3134880487 cites W1990326494 @default.
• W3134880487 cites W1996684664 @default.
• W3134880487 cites W2000182187 @default.
• W3134880487 cites W2008423363 @default.
• W3134880487 cites W2009072875 @default.
• W3134880487 cites W2009803313 @default.
• W3134880487 cites W2009938762 @default.
• W3134880487 cites W2023743599 @default.
• W3134880487 cites W2036971781 @default.
• W3134880487 cites W2037935057 @default.
• W3134880487 cites W2042373356 @default.
• W3134880487 cites W2044146725 @default.
• W3134880487 cites W2044482255 @default.
• W3134880487 cites W2045640143 @default.
• W3134880487 cites W2047684506 @default.
• W3134880487 cites W2054950944 @default.
• W3134880487 cites W2062808512 @default.
• W3134880487 cites W2065419861 @default.
• W3134880487 cites W2069416867 @default.
• W3134880487 cites W2073576149 @default.
• W3134880487 cites W2078824348 @default.
• W3134880487 cites W2087216833 @default.
• W3134880487 cites W2092574579 @default.
• W3134880487 cites W2093517413 @default.
• W3134880487 cites W2098439910 @default.
• W3134880487 cites W2113048862 @default.
• W3134880487 cites W2115049345 @default.
• W3134880487 cites W2115957362 @default.
• W3134880487 cites W2117858572 @default.
• W3134880487 cites W2117972428 @default.
• W3134880487 cites W2119546824 @default.
• W3134880487 cites W2119874352 @default.
• W3134880487 cites W2120686390 @default.
• W3134880487 cites W2121035174 @default.
• W3134880487 cites W2123785786 @default.
• W3134880487 cites W2124637492 @default.
• W3134880487 cites W2133494553 @default.
• W3134880487 cites W2153561032 @default.
• W3134880487 cites W2162275416 @default.
• W3134880487 cites W2469165122 @default.
• W3134880487 cites W2505968561 @default.
• W3134880487 cites W2563147102 @default.
• W3134880487 cites W2915069302 @default.
• W3134880487 cites W2916382463 @default.
• W3134880487 cites W2962824589 @default.
• W3134880487 cites W3123050985 @default.
• W3134880487 cites W4205854255 @default.
• W3134880487 cites W4252973173 @default.
• W3134880487 doi "https://doi.org/10.1287/ijoc.2020.1018" @default.
• W3134880487 hasPublicationYear "2021" @default.
• W3134880487 type Work @default.
• W3134880487 sameAs 3134880487 @default.
• W3134880487 citedByCount "2" @default.
• W3134880487 countsByYear W31348804872022 @default.
• W3134880487 crossrefType "journal-article" @default.
• W3134880487 hasAuthorship W3134880487A5032371377 @default.
• W3134880487 hasAuthorship W3134880487A5051343300 @default.
• W3134880487 hasAuthorship W3134880487A5064878667 @default.
• W3134880487 hasConcept C109839438 @default.
• W3134880487 hasConcept C112680207 @default.
• W3134880487 hasConcept C11413529 @default.
• W3134880487 hasConcept C118615104 @default.
• W3134880487 hasConcept C124119293 @default.
• W3134880487 hasConcept C126255220 @default.
• W3134880487 hasConcept C127413603 @default.
• W3134880487 hasConcept C132525143 @default.
• W3134880487 hasConcept C13743678 @default.
• W3134880487 hasConcept C146978453 @default.
• W3134880487 hasConcept C177264268 @default.
• W3134880487 hasConcept C199360897 @default.
• W3134880487 hasConcept C206194317 @default.
• W3134880487 hasConcept C2524010 @default.
• W3134880487 hasConcept C25360446 @default.
• W3134880487 hasConcept C33923547 @default.
• W3134880487 hasConcept C41008148 @default.
• W3134880487 hasConcept C41045048 @default.
• W3134880487 hasConcept C48903430 @default.
• W3134880487 hasConcept C56086750 @default.
• W3134880487 hasConcept C64331007 @default.
• W3134880487 hasConcept C76220878 @default.
• W3134880487 hasConcept C80444323 @default.

• next