A solvable routing problem

DOI10.1002/NET.3230190508MaRDI QIDQ3824127zbMATH OpenOpenAlexFDO

Authors E. N. Gilbert

Publication date 1989

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

billing problemchannel layoutlarge communications networkminimal spanningnetwork of cablesrouting problemtree

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3850794
• scientific article; zbMATH DE number 4051669
• A direct solution of allocation problems
• Steiner tree problems in telecommunications
• An algorithm of the minimal cost spanning tree about communication network

Cites work

• On the Problem of Steiner

Cited in

(2)

• Nearest route problem
• The dynamic bowser routing problem

This page was built for publication: A solvable routing problem

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