A constrained Steiner tree problem (Q1129916): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest chain subject to side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for planning capacity expansion in local access telecommunication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lagrangean decomposition: An application to the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SST-based 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: An algorithm for the solution of the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of telecommunication networks --- local access design methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the steiner tree problem in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The telephonic switching centre network problem: Formalization and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank

Latest revision as of 14:51, 28 May 2024

scientific article
Language Label Description Also known as
English
A constrained Steiner tree problem
scientific article

    Statements

    A constrained Steiner tree problem (English)
    0 references
    0 references
    0 references
    16 August 1998
    0 references
    relaxation
    0 references
    Steiner tree problem
    0 references
    one additional side constraint
    0 references

    Identifiers