Maximising the worth of nascent networks

DOI10.1007/s11067-013-9199-1zbMath1339.90080OpenAlexW2111682031WikidataQ58229665 ScholiaQ58229665MaRDI QIDQ301061

P. W. Heijnen, A. Ligtvoet, P. M. Herder, R. M. Stikkelman

Publication date: 29 June 2016

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-013-9199-1

zbMATH Keywords

uncertaintygraph theorySteiner treeinfrastructural networks and constraintsmaximising worth

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90) Signed and weighted graphs (05C22)

Related Items (2)

An approach for integrating valuable flexibility during conceptual design of networks ⋮ Multimodal transportation flows in energy networks with an application to crude oil markets

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Minimax regret spanning arborescences under uncertain costs
• The Steiner tree problem
• Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
• Short trees in polygons
• Adaptive policies, policy analysis, and policy-making
• Local search for the Steiner tree problem in the Euclidean plane
• On the Problem of Steiner
• Euclidean shortest paths in the presence of rectilinear barriers
• The probabilistic minimum spanning tree problem
• Augmenting Euclidean Networks—the Steiner Case
• Visibility graphs and obstacle-avoiding shortest paths
• Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
• Minimum cost flow‐dependent communication networks
• Steiner Minimal Trees
• Steiner minimal trees with one polygonal obstacle.

This page was built for publication: Maximising the worth of nascent networks