Pages that link to "Item:Q1330902"

The following pages link to The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902):

Displaying 43 items.

• Optimal capacitated ring trees (Q286687) (← links)
• Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
• Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
• Polyhedral study of the connected subgraph problem (Q468440) (← links)
• A partition-based relaxation for Steiner trees (Q535014) (← links)
• New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• Non delayed relax-and-cut algorithms (Q817212) (← links)
• A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
• Intermediate integer programming representations using value disjunctions (Q951104) (← links)
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
• Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
• Directed Steiner problems with connectivity constraints (Q1315992) (← 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)
• Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
• A note on the generalized Steiner tree polytope (Q1962028) (← links)
• Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← links)
• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
• Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
• Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
• Idealness and 2-resistant sets (Q2294336) (← links)
• Towards a lifecycle oriented design of infrastructure by mathematical optimization (Q2327920) (← links)
• The robust network loading problem with dynamic routing (Q2377165) (← links)
• The Steiner connectivity problem (Q2434988) (← links)
• Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
• Some formulations for the group Steiner tree problem (Q2500536) (← links)
• Towards optimizing the deployment of optical access networks (Q2513732) (← 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)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
• Dimensioning multicast-enabled communications networks (Q3150132) (← links)
• Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
• Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
• An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
• Opposite Elements in Clutters (Q5219549) (← links)
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• Optimizing the Design of a Wind Farm Collection Network (Q6102753) (← links)
• Vertex covering with capacitated trees (Q6179715) (← links)