scientific article; zbMATH DE number 5173833
From MaRDI portal
zbMath1118.90051MaRDI QIDQ5294063
Geir Dahl, Cristina Requejo, Luís Gouveia
Publication date: 23 July 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An Exact Algorithm for the Steiner Tree Problem with Delays, Routing of uncertain traffic demands, Optimal relay node placement in delay constrained wireless sensor network design, Hop constrained Steiner trees with multiple root nodes, Modeling and solving the rooted distance-constrained minimum spanning tree problem, Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem, Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem, Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem, A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks, A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints, Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem, Container shipping service selection and cargo routing with transshipment limits, Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks, A polyhedral study of the diameter constrained minimum spanning tree problem, New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints, Optimal Network Design with End-to-End Service Requirements, A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks, Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints, Combined route capacity and route length models for unit demand vehicle routing problems, A complete characterization of jump inequalities for the hop-constrained shortest path problem, New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints, Characterization of facets of the hop constrained chain polytope via dynamic programming, Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics, On Hop-Constrained Steiner Trees in Tree-Like Metrics
