A dual ascent approach for steiner tree problems on a directed graph (Q3315294): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q4139967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Location in Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct dual method for the mixed plant location problem with some side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank

Latest revision as of 11:57, 14 June 2024

scientific article
Language Label Description Also known as
English
A dual ascent approach for steiner tree problems on a directed graph
scientific article

    Statements

    A dual ascent approach for steiner tree problems on a directed graph (English)
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational results
    0 references
    Steiner tree problem
    0 references
    directed graph
    0 references
    directed subtree
    0 references
    dual ascent procedure
    0 references
    lower bounds to the optimal solution value
    0 references
    heuristic procedure
    0 references
    directed spanning tree
    0 references
    uncapacitated plant location
    0 references