Pages that link to "Item:Q2583134"

The following pages link to An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134):

Displayed 11 items.

• Prize collecting Steiner trees with node degree dependent costs (Q709134) ‎ (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) ‎ (← links)
• Computing the metric dimension of graphs by genetic algorithms (Q849088) ‎ (← links)
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) ‎ (← links)
• Combinatorial optimization in system configuration design (Q1027725) ‎ (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) ‎ (← links)
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) ‎ (← links)
• Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems (Q2638378) ‎ (← links)
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) ‎ (← links)
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) ‎ (← links)
• Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) ‎ (← links)