Pages that link to "Item:Q1322552"
From MaRDI portal
The following pages link to The Steiner tree polytope and related polyhedra (Q1322552):
Displaying 43 items.
- Optimal capacitated ring trees (Q286687) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
- The Steiner tree problem. II: Properties and classes of facets (Q1330903) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
- The Steiner cycle polytope (Q1873013) (← links)
- Packing Steiner trees: Further facets (Q1908272) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- The facets of the spanning trees polytope (Q2168051) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
- Traveling salesman path problems (Q2476987) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
- \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- (Q4542225) (← links)
- An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
- Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
- Bounded-degree rooted tree and TDI-ness (Q5104597) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
- General variable neighborhood search approach to group Steiner tree problem (Q6063507) (← 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)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
