FRINK Linked Data Fragments server

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

• W2803872014 endingPage "420" @default.
• W2803872014 startingPage "402" @default.
• W2803872014 abstract "AboutSectionsView PDF ToolsAdd to favoritesDownload CitationsTrack CitationsPermissionsReprints ShareShare onFacebookTwitterLinked InEmail Go to Section HomeINFORMS Journal on ComputingVol. 30, No. 2 A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related ProblemsMarkus Leitner , Ivana Ljubić , Martin Luipersbeck, Markus SinnlMarkus Leitner , Ivana Ljubić , Martin Luipersbeck, Markus SinnlPublished Online:25 May 2018https://doi.org/10.1287/ijoc.2017.0788AbstractWe present a branch-and-bound (B&B) framework for the asymmetric prize-collecting Steiner tree problem (APCSTP). Several well-known network design problems can be transformed to the APCSTP, including the Steiner tree problem (STP), prize-collecting Steiner tree problem (PCSTP), maximum-weight connected subgraph problem (MWCS), and node-weighted Steiner tree problem (NWSTP). The main component of our framework is a new dual ascent algorithm for the rooted APCSTP, which generalizes Wong’s dual ascent algorithm for the Steiner arborescence problem. The lower bounds and dual information obtained from the algorithm are exploited within powerful bound-based reduction tests and for guiding primal heuristics. The framework is complemented by additional alternative-based reduction tests. Extensive computational results on benchmark instances for the PCSTP, MWCS, and NWSTP indicate the framework’s effectiveness, as most instances from literature are solved to optimality within seconds, including most of the (previously unsolved) largest instances from the recent DIMACS Challenge on Steiner trees. Moreover, results on new asymmetric instances for the APCSTP are reported. Since the addressed network design problems are frequently used for modeling various real-world applications (e.g., in bioinformatics), the implementation of the presented B&B framework has been made publicly available.The online supplement is available at https://doi.org/10.1287/ijoc.2017.0788. Previous Back to Top FiguresReferencesRelatedInformationCited byCasting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator ProblemFurini Fabio, Ljubić Ivana, Malaguti Enrico, Paronuzzi Paolo16 September 2021 | Operations Research, Vol. 70, No. 4On the Exact Solution of Prize-Collecting Steiner Tree ProblemsDaniel Rehfeldt, Thorsten Koch6 October 2021 | INFORMS Journal on Computing, Vol. 34, No. 2Combinatorial Heuristics for Inventory Routing ProblemsZiye Tang, Yang Jiao, R. Ravi20 August 2021 | INFORMS Journal on Computing, Vol. 34, No. 1 Volume 30, Issue 2Spring 2018Pages 217-420 Article Information Supplemental Materials Metrics Information Received:June 03, 2016Accepted:September 04, 2017Published Online:May 25, 2018 Copyright © 2018, INFORMSCite asMarkus Leitner, Ivana Ljubić, Martin Luipersbeck, Markus Sinnl (2018) A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. INFORMS Journal on Computing 30(2):402-420. https://doi.org/10.1287/ijoc.2017.0788 KeywordsSteiner treesprize-collecting Steiner treesdual ascentreduction testsbranch-and-boundPDF download" @default.
• W2803872014 created "2018-06-01" @default.
• W2803872014 creator A5009286436 @default.
• W2803872014 creator A5024184384 @default.
• W2803872014 creator A5030387525 @default.
• W2803872014 creator A5039967152 @default.
• W2803872014 date "2018-05-01" @default.
• W2803872014 modified "2023-10-18" @default.
• W2803872014 title "A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems" @default.
• W2803872014 cites W2001139415 @default.
• W2803872014 cites W2008534472 @default.
• W2803872014 cites W201760388 @default.
• W2803872014 cites W2020586530 @default.
• W2803872014 cites W2058692618 @default.
• W2803872014 cites W2067164255 @default.
• W2803872014 cites W2068362339 @default.
• W2803872014 cites W2074613642 @default.
• W2803872014 cites W2084876869 @default.
• W2803872014 cites W2096389124 @default.
• W2803872014 cites W2108303241 @default.
• W2803872014 cites W2111379929 @default.
• W2803872014 cites W2113308846 @default.
• W2803872014 cites W2155239253 @default.
• W2803872014 cites W2171662214 @default.
• W2803872014 cites W2522051431 @default.
• W2803872014 cites W2528914664 @default.
• W2803872014 cites W2564086439 @default.
• W2803872014 cites W4246185962 @default.
• W2803872014 doi "https://doi.org/10.1287/ijoc.2017.0788" @default.
• W2803872014 hasPublicationYear "2018" @default.
• W2803872014 type Work @default.
• W2803872014 sameAs 2803872014 @default.
• W2803872014 citedByCount "23" @default.
• W2803872014 countsByYear W28038720142017 @default.
• W2803872014 countsByYear W28038720142018 @default.
• W2803872014 countsByYear W28038720142019 @default.
• W2803872014 countsByYear W28038720142020 @default.
• W2803872014 countsByYear W28038720142021 @default.
• W2803872014 countsByYear W28038720142022 @default.
• W2803872014 crossrefType "journal-article" @default.
• W2803872014 hasAuthorship W2803872014A5009286436 @default.
• W2803872014 hasAuthorship W2803872014A5024184384 @default.
• W2803872014 hasAuthorship W2803872014A5030387525 @default.
• W2803872014 hasAuthorship W2803872014A5039967152 @default.
• W2803872014 hasConcept C111335779 @default.
• W2803872014 hasConcept C113174947 @default.
• W2803872014 hasConcept C114614502 @default.
• W2803872014 hasConcept C126255220 @default.
• W2803872014 hasConcept C127705205 @default.
• W2803872014 hasConcept C13280743 @default.
• W2803872014 hasConcept C134306372 @default.
• W2803872014 hasConcept C185798385 @default.
• W2803872014 hasConcept C205649164 @default.
• W2803872014 hasConcept C2524010 @default.
• W2803872014 hasConcept C33923547 @default.
• W2803872014 hasConcept C41008148 @default.
• W2803872014 hasConcept C76220878 @default.
• W2803872014 hasConcept C77553402 @default.
• W2803872014 hasConcept C93693863 @default.
• W2803872014 hasConceptScore W2803872014C111335779 @default.
• W2803872014 hasConceptScore W2803872014C113174947 @default.
• W2803872014 hasConceptScore W2803872014C114614502 @default.
• W2803872014 hasConceptScore W2803872014C126255220 @default.
• W2803872014 hasConceptScore W2803872014C127705205 @default.
• W2803872014 hasConceptScore W2803872014C13280743 @default.
• W2803872014 hasConceptScore W2803872014C134306372 @default.
• W2803872014 hasConceptScore W2803872014C185798385 @default.
• W2803872014 hasConceptScore W2803872014C205649164 @default.
• W2803872014 hasConceptScore W2803872014C2524010 @default.
• W2803872014 hasConceptScore W2803872014C33923547 @default.
• W2803872014 hasConceptScore W2803872014C41008148 @default.
• W2803872014 hasConceptScore W2803872014C76220878 @default.
• W2803872014 hasConceptScore W2803872014C77553402 @default.
• W2803872014 hasConceptScore W2803872014C93693863 @default.
• W2803872014 hasIssue "2" @default.
• W2803872014 hasLocation W28038720141 @default.
• W2803872014 hasOpenAccess W2803872014 @default.
• W2803872014 hasPrimaryLocation W28038720141 @default.
• W2803872014 hasRelatedWork W1503036335 @default.
• W2803872014 hasRelatedWork W1931020284 @default.
• W2803872014 hasRelatedWork W2024470714 @default.
• W2803872014 hasRelatedWork W2025658531 @default.
• W2803872014 hasRelatedWork W2118320476 @default.
• W2803872014 hasRelatedWork W2161182859 @default.
• W2803872014 hasRelatedWork W2182290077 @default.
• W2803872014 hasRelatedWork W2389899617 @default.
• W2803872014 hasRelatedWork W2803872014 @default.
• W2803872014 hasRelatedWork W4319942994 @default.
• W2803872014 hasVolume "30" @default.
• W2803872014 isParatext "false" @default.
• W2803872014 isRetracted "false" @default.
• W2803872014 magId "2803872014" @default.
• W2803872014 workType "article" @default.