Pages that link to "Item:Q3315294"
From MaRDI portal
The following pages link to A dual ascent approach for steiner tree problems on a directed graph (Q3315294):
Displaying 50 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← 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)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- A multicast problem with shared risk cost (Q691394) (← links)
- On the core of network synthesis games (Q757264) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks (Q819071) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← 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)
- The telephonic switching centre network problem: Formalization and computational experience (Q1093558) (← links)
- A constrained Steiner tree problem (Q1129916) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Tree polytope on 2-trees (Q1322553) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- Comparison of formulations and a heuristic for packing Steiner trees in a graph (Q1339122) (← links)
- Routing and capacity assignment in backbone communication networks (Q1373886) (← links)
- Generalized spanning trees (Q1579496) (← links)
- Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints (Q1676485) (← 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)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
