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

Network generation using the Prufer code

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

DOI10.1016/0305-0548(86)90075-4zbMath0617.90024OpenAlexW1985996025MaRDI QIDQ1088882

Catherine M. Murphy, Ming S. Hung

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90075-4


zbMATH Keywords

bipartitetransportationshortest pathassignmentmaximum flowtransshipmentinteractive programPrufer codetripartite


Mathematics Subject Classification ID

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


Related Items (3)

A capacitated general routing problem on mixed networks ⋮ A computational study of efficient shortest path algorithms ⋮ An exterior simplex type algorithm for the minimum cost network flow problem


Uses Software

  • NETGEN


Cites Work

  • NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
  • Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Network generation using the Prufer code

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