Pages that link to "Item:Q2466593"
From MaRDI portal
The following pages link to Reduction tests for the prize-collecting Steiner problem (Q2466593):
Displaying 11 items.
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← 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)
- Further contributions to network optimization (Q5487817) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
