Probabilistic analysis of a network design problem heuristic

DOI10.1002/NET.3230150306MaRDI QIDQ3705241zbMATH OpenOpenAlexWikidataFDO

Authors Richard T. Wong

Publication date 1985

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230150306

zbMATH Keywords

budget network design problemComputational resultsheuristic

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35)

Recommendations

• THE PROBABILISTIC NETWORK DESIGN PROBLEM
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Network design with probabilistic capacities
• Probabilistic analysis of a network resource allocation algorithm
• Probabilistic Analysis of Network Flow Algorithms
• Probabilistic analysis of a routing problem
• scientific article; zbMATH DE number 3821434
• Heuristics for the network design problem with connectivity requirements
• A network design model under uncertainty

Cites work

• A Computational Approach to the Selection of an Optimal Network
• scientific article; zbMATH DE number 3593565 (Why is no real title available?)

Cited in

(6)

• Heuristic methods and applications: A categorized survey
• scientific article; zbMATH DE number 3821434 (Why is no real title available?)
• scientific article; zbMATH DE number 795219 (Why is no real title available?)
• THE PROBABILISTIC NETWORK DESIGN PROBLEM
• Heuristics for budget facility location-network design problems with minisum objective
• Continuous approximation formulas for location problems

This page was built for publication: Probabilistic analysis of a network design problem heuristic

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