Pages that link to "Item:Q5285475"
From MaRDI portal
The following pages link to A catalog of steiner tree formulations (Q5285475):
Displaying 50 items.
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- A multicast problem with shared risk cost (Q691394) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- Network flow models for the local access network expansion problem (Q856692) (← links)
- Multicommodity flow models for spanning trees with hop constraints (Q1278374) (← links)
- Designing reliable tree networks with two cable technologies (Q1291775) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
- An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints (Q1676485) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Generalized network design problems. (Q1810478) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems (Q2226969) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
- Integer programming formulations for the shared multicast tree problem (Q2331596) (← links)
- The multi-weighted Steiner tree problem: A reformulation by intersection (Q2483504) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- A node rooted flow-based model for the local access network expansion problem (Q2654316) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
- Cost optimized design for the local wind turbine grid of an onshore wind farm (Q2675720) (← links)
- A comparative analysis of several formulations for the generalized minimum spanning tree problem (Q2782729) (← links)
- Reload cost trees and network design (Q2913949) (← links)
- The regenerator location problem (Q3057148) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
- An Efficient Iterative Method for the Formulation of Flow Networks (Q5077703) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← links)
- Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← 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)
- Optimizing the Design of a Wind Farm Collection Network (Q6102753) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
