Pages that link to "Item:Q5131733"
From MaRDI portal
The following pages link to A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733):
Displaying 15 items.
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← links)
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- New formulations for two location problems with interconnected facilities (Q6128897) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems (Q6564769) (← links)
- An efficient solver for large-scale onshore wind farm siting including cable routing (Q6572902) (← links)
