Stronger path‐based extended formulation for the Steiner tree problem (Q6068530): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q127655226, #quickstatements; #temporary_batch_1722209980517
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.21901 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.21901 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2950605182 / 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: Q3046489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / 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: Thinning out Steiner trees: a node-based model for uniform edge costs / 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: SCIP-Jack -- a solver for STP and variants with parallelization extensions / 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: The multi-weighted Steiner tree problem: A reformulation by intersection / 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 Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: A comparison of Steiner tree relaxations / 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: Tighter Bounds for Graph Steiner Tree Approximation / 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.21901 / rank
 
Normal rank

Latest revision as of 18:08, 30 December 2024

scientific article; zbMATH DE number 7764299
Language Label Description Also known as
English
Stronger path‐based extended formulation for the Steiner tree problem
scientific article; zbMATH DE number 7764299

    Statements

    Stronger path‐based extended formulation for the Steiner tree problem (English)
    0 references
    0 references
    0 references
    0 references
    13 November 2023
    0 references
    extended formulation
    0 references
    flow-based formulation
    0 references
    integrality gap
    0 references
    linear programming relaxation
    0 references
    mixed integer linear programming
    0 references
    Steiner tree
    0 references

    Identifiers