Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The network synthesis problem in a cycle

From MaRDI portal
Publication:1924616
Jump to:navigation, search

DOI10.1016/0167-6377(95)00022-CzbMath0857.90128MaRDI QIDQ1924616

Mehran Hojati

Publication date: 20 October 1996

Published in: Operations Research Letters (Search for Journal in Brave)


zbMATH Keywords

cyclenetwork synthesisflow algorithmsundirected networkminimum total construction costmulti-terminal


Mathematics Subject Classification ID

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


Related Items (2)

Multi-terminal multipath flows: synthesis ⋮ Integer version of the multipath flow network synthesis problem




Cites Work

  • A note on two problems in connexion with graphs
  • An Application of Generalized Linear Programming to Network Flows
  • Multi-Terminal Network Flows




This page was built for publication: The network synthesis problem in a cycle

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1924616&oldid=14354731"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 15:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki