The hierarchical network design problem with multiple primary paths
type: Item
instance of: scholarly article
title: The hierarchical network design problem with multiple primary paths
zbMATH Open document ID: 0924.90130
DOI: 10.1016/0377-2217(95)00333-9
author: N. G. F. Sancho
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1253007
zbMATH Keywords: shortest spanning tree
zbMATH Keywords: hierarchical network design
zbMATH Keywords: suboptimal solution
zbMATH Keywords: multiple primary paths
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00333-9
OpenAlex ID: W2005480958
cites work: The hierarchical network design problem
cites work: The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
cites work: A suboptimal solution to a hierarchical network design problem using dynamic programming
Wikidata QID: Q127236838
Recommended article: The hierarchical network design problem
Recommended article: An addendum to the hierarchical network design problem
Recommended article: Optimal design of hierarchical networks with free main path extremes
Recommended article: Q3481517
Recommended article: A branch and cut algorithm for the hierarchical network design problem
Recommended article: The multi-layered network design problem
Recommended article: Q4229631
Recommended article: Reducing the hierarchical network design problem
Recommended article: The Two Level Network Design Problem with Secondary Hop Constraints
Recommended article: A suboptimal solution to a hierarchical network design problem using dynamic programming
description: scientific article; zbMATH DE number 1253007