A robust and scalable algorithm for the Steiner problem in graphs (Q1646683): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s12532-017-0123-4 / rank
Normal rank
 
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the impact of primal heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the steiner problem in grapsh / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient path and vertex exchange in steiner tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP-Jack -- a solver for STP and variants with parallelization extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and integrality gaps for hypergraphic steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding and Updating Spanning Trees and Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the Steiner problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for Graph Steiner Tree Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing Steiner problems from VLSI layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs: Heuristic methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear group Steiner trees and applications in VLSI design / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S12532-017-0123-4 / rank
 
Normal rank

Latest revision as of 00:42, 11 December 2024

scientific article
Language Label Description Also known as
English
A robust and scalable algorithm for the Steiner problem in graphs
scientific article

    Statements

    A robust and scalable algorithm for the Steiner problem in graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2018
    0 references
    Steiner trees
    0 references
    local search
    0 references
    metaheuristics
    0 references
    dual ascent
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references