Pages that link to "Item:Q4540078"
From MaRDI portal
The following pages link to Solving Steiner tree problems in graphs to optimality (Q4540078):
Displaying 50 items.
- SteinLib (Q16253) (← links)
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Optimal capacitated ring trees (Q286687) (← links)
- Benders decomposition of the passive optical network design problem (Q325394) (← links)
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Optimal design of hierarchical networks with free main path extremes (Q943800) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Delay-related secondary objectives for rectilinear Steiner minimum trees. (Q1427185) (← links)
- The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (Q1652235) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← 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)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
- On Steiner trees and minimum spanning trees in hypergraphs (Q1869998) (← links)
- A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
- Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- Optimal Steiner trees under node and edge privacy conflicts (Q2156311) (← 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)
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- A branch and cut algorithm for the hierarchical network design problem (Q2379520) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
