| Title: | Maximum flow problem on dynamic generative network flows with time-varying bounds |
|---|
| Authors: | ID Salehi Fathabadi, Hassan, School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran (Author)
ID Hosseini, Ahmad, School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran (Author) |
|---|
| Files: |
This document has no files that are freely available to the public. This document may have a physical copy in the library of the organization, check the status via COBISS.  |
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | UNG - University of Nova Gorica
|
|---|
| Keywords: | Networks, Dynamic Flows, Linear Programs, Decomposition Methods |
|---|
| Publication version: | Version of Record |
|---|
| Year of publishing: | 2010 |
|---|
| Number of pages: | 12 |
|---|
| Numbering: | 8, 34 |
|---|
| PID: | 20.500.12556/RUNG-7945 |
|---|
| COBISS.SI-ID: | 141710851 |
|---|
| DOI: | https://doi.org/10.1016/j.apm.2009.10.026 |
|---|
| NUK URN: | URN:SI:UNG:REP:NBDWJ2UA |
|---|
| Publication date in RUNG: | 14.02.2023 |
|---|
| Views: | 862 |
|---|
| Downloads: | 1 |
|---|
| Metadata: |     |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
