A Computational Approach to the Selection of an Optimal Network

DOI10.1287/MNSC.19.5.488MaRDI QIDQ5663622zbMATH OpenOpenAlexFDO

Authors Hoang Hai Hoc

Publication date 1973

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.19.5.488

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)

Cited in

(10)

• Solving the optimal network problem
• A survey on Benders decomposition applied to fixed-charge network design problems
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Lower bounding techniques for the degree-constrained network design problem
• Probabilistic analysis of a network design problem heuristic
• Network design problem with congestion effects: A case of bilevel programming
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Worst-Case Analysis of Network Design Problem Heuristics
• Models for planning capacity expansion in local access telecommunication networks
• On the minimum average distance spanning tree of the hypercube

This page was built for publication: A Computational Approach to the Selection of an Optimal Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663622)