Pages that link to "Item:Q5946826"

The following pages link to Improved algorithms for the Steiner problem in networks (Q5946826):

Displaying 15 items.

• Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778) (← links)
• A partition-based relaxation for Steiner trees (Q535014) (← links)
• A multicast problem with shared risk cost (Q691394) (← links)
• Designing a road network for hazardous materials shipments (Q853892) (← links)
• Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
• Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
• A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
• Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
• On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
• A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
• A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)
• A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)