Binary Steiner trees: structural results and an exact solution approach (Q1751166): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2016.05.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2469753241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of nearly minimal Steiner trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. II: Properties and classes of facets / 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 branch and cut algorithm for the Steiner problem in graphs / 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: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut method for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some network design problems with degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithm for Degree Bounded Survivable Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable Network Design with Degree or Order Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Guarantees for Degree-Bounded Directed Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for degree-constrained minimum-cost network-design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum-Degree Steiner Tree to within One of Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem in phylogeny is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest connectivity. An introduction with applications in phylogeny. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Degree Spanning Trees of Small Weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many birds with one stone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theory applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / 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: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank

Latest revision as of 16:07, 15 July 2024

scientific article
Language Label Description Also known as
English
Binary Steiner trees: structural results and an exact solution approach
scientific article

    Statements

    Binary Steiner trees: structural results and an exact solution approach (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    Steiner tree
    0 references
    degree constraint
    0 references
    Steiner ratio
    0 references
    integer programming
    0 references
    polytope
    0 references
    branch-\&-cut
    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
    0 references
    0 references

    Identifiers

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