Lagrangean decomposition/relaxation for the routing and wavelength assignment problem (Q2892159): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of path coloring and call scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On column generation formulations for the RWA problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and wavelength assignment by partition colouring / rank
 
Normal rank

Latest revision as of 09:18, 5 July 2024

scientific article
Language Label Description Also known as
English
Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
scientific article

    Statements

    Lagrangean decomposition/relaxation for the routing and wavelength assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    0 references
    routing and wavelength assignment problem
    0 references
    shortest path problem
    0 references
    knapsack problem
    0 references
    Lagrangean relaxation
    0 references
    Lagrangean decomposition
    0 references
    subgradient method
    0 references
    0 references