The following pages link to (Q3760270):
Displayed 32 items.
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
- A constrained Steiner tree problem (Q1129916) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- Steiner trees with \(n\) terminals among \(n+1\) nodes (Q1197890) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- Clustering heuristics for set covering (Q1309879) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- A look at the past and present of optimization - an editorial (Q1926685) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
- The Performance of greedy algorithms for the on-line steiner tree and related problems (Q4850333) (← links)
- Greedy algorithms for the on-line steiner tree and generalized steiner problems (Q5060154) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← links)
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)
- Lagrangian relaxation for maximum service in multicast routing with QoS constraints (Q6082266) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)