A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58024614, #quickstatements; #temporary_batch_1707252663060
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-hop spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow models for spanning trees with hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet Routing in Telecommunication Networks with Path and Flow Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(00)00143-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052035035 / rank
 
Normal rank

Latest revision as of 09:46, 30 July 2024

scientific article; zbMATH DE number 1626204
Language Label Description Also known as
English
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
scientific article; zbMATH DE number 1626204

    Statements

    A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    2001
    0 references
    Design of centralized networks
    0 references
    Quality of service constraints
    0 references
    Hop constraints
    0 references
    Lagrangean relaxation
    0 references
    Multicommodity flows
    0 references
    minimum spanning tree
    0 references
    centralized telecommunication networks
    0 references
    linear programming relaxation
    0 references

    Identifiers