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):
Displayed 50 items.
- On cuts and matchings in planar graphs (Q688915) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← 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)
- 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)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
- Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks (Q1869722) (← links)
- On Steiner trees and minimum spanning trees in hypergraphs (Q1869998) (← links)
- A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
- On the core of the minimum cost Steiner tree game in networks (Q1897387) (← links)
- Topological design of a two-level network with ring-star configuration (Q2367422) (← links)
- Viral systems: A new bio-inspired optimisation approach (Q2475843) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- (Q2741494) (← links)
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES (Q3021975) (← links)
- THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM (Q3021994) (← links)
- Dimensioning multicast-enabled communications networks (Q3150132) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- An integer programming formulation of the Steiner problem in graphs (Q4031973) (← links)
- The Performance of greedy algorithms for the on-line steiner tree and related problems (Q4850333) (← links)
- (Q5708491) (← links)
- Dual-based approach for a hub network design problem under non-restrictive policy (Q5938396) (← links)