scientific article; zbMATH DE number 6913891
From MaRDI portal
Publication:4577932
zbMath1392.90119MaRDI QIDQ4577932
Hassan Rezapour, Gholam Hassan Shirdel
Publication date: 6 August 2018
Full work available at URL: https://hrcak.srce.hr/ojs/index.php/crorr/article/view/4367
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- On solving continuous-time dynamic network flows
- The time-varying shortest path problem with fuzzy transit costs and speedup
- Time-varying network optimization.
- A survey of dynamic network flows
- Maximum flow problem on dynamic generative network flows with time-varying bounds
- Robust discrete optimization and network flows
- Optimal Flows in Dynamic Networks and Algorithms for their Finding
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Minimum cost time-varying network flow problems
- Minimum weight paths in time-dependent networks
- Time-varying shortest path problems with constraints
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- Constructing Maximal Dynamic Flows from Static Flows
- Time-varying minimum cost flow problems
This page was built for publication:
