The multi-weighted Steiner tree problem: A reformulation by intersection (Q2483504): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The hierarchical network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-weighted Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented arborescence formulation for the two-level network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Algorithm for Multi-Level Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank

Latest revision as of 22:26, 27 June 2024

scientific article
Language Label Description Also known as
English
The multi-weighted Steiner tree problem: A reformulation by intersection
scientific article

    Statements

    The multi-weighted Steiner tree problem: A reformulation by intersection (English)
    0 references
    0 references
    0 references
    28 April 2008
    0 references
    0 references
    network design
    0 references
    spanning trees and Steiner trees
    0 references
    linear programming relaxation
    0 references
    reformulation techniques
    0 references
    Lagrangean relaxation
    0 references
    0 references