Pages that link to "Item:Q1417851"

The following pages link to Solving Steiner tree problems in graphs with Lagrangian relaxation (Q1417851):

Displaying 11 items.

• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
• Traffic engineering of tunnel-based networks with class specific diversity requirements (Q857786) (← links)
• A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
• A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
• Multicast tree rearrangement to recover node failures in overlay multicast networks (Q2566926) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)