A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.21913 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q127124378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable special cases of the Steiner problem in planar networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of the space of phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek-Steiner Ratio in Graphs / 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: Hypergraphic LP Relaxations for Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem on graphs: inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / 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: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swap-vertex based neighborhood for Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree polytope and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / 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: 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 partition-based relaxation for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Steiner tree relaxations / 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: Q4411411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner trees and minimum spanning trees in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical greedy approximation for the directed Steiner tree problem / 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 / DOI
 
Property / DOI: 10.1002/NET.21913 / rank
 
Normal rank

Latest revision as of 18:08, 30 December 2024

scientific article; zbMATH DE number 7764307
Language Label Description Also known as
English
A linear programming based approach to the Steiner tree problem with a fixed number of terminals
scientific article; zbMATH DE number 7764307

    Statements

    A linear programming based approach to the Steiner tree problem with a fixed number of terminals (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 2023
    0 references
    convex hull
    0 references
    independent subproblems
    0 references
    integer programming
    0 references
    laminar family
    0 references
    linear programming
    0 references
    Steiner tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers