Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Optimization of the flow through networks with gains (1972)
    Springer
    Mathematical programming 3 (1972), S. 135-144 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The optimal flow problem in networks with gains is presented through the simplex method. Out of simple theorical conditions, a method is built which needs only a relatively small number memory and quite a short calculation time by computer. Large examples are given; e.g., one test-example of 1000 nodes and 3000 arcs, and one real problem leading to a linear program of 3000 constraints and 8000 arcs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584985
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...