scientific article; zbMATH DE number 1918689
From MaRDI portal
Publication:4483658
Recommendations
- The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
- Minimum cost time-varying network flow problems
- Determining minimum cost flows in dynamic networks with transit time functions that depend on flow and time
- scientific article; zbMATH DE number 1984104
- Optimal flows in dynamic networks and algorithms for their finding
Cited in
(42)- The minimal average cost flow problem
- A note on the minimum instantaneous cost path of the dynamic traffic assignment problem
- Infinite networks: Minimal cost flows
- Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
- The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Dynamic network flows with uncertain costs belonging to interval
- Minimum cost flow problem on dynamic multi generative network flows
- A parametric approach to the Bi-Criteria minimum cost dynamic flow problem
- Optimal flows in dynamic networks and algorithms for their finding
- Algorithms for finding optimal flows in dynamic networks
- scientific article; zbMATH DE number 2187103 (Why is no real title available?)
- Interactive tool for the successive shortest paths algorithm in solving the minimum cost flow problem
- scientific article; zbMATH DE number 5990494 (Why is no real title available?)
- A minimum cost network flow model for the maximum covering and patrol routing problem
- Minimum cost paths over dynamic networks
- scientific article; zbMATH DE number 3858800 (Why is no real title available?)
- Dynamic minimum cost path problem with curfews
- Determining minimum cost flows in dynamic networks with transit time functions that depend on flow and time
- Performance of Shortest Path Algorithms in Network Flow Problems
- scientific article; zbMATH DE number 4156169 (Why is no real title available?)
- Discussion on the inverse dynamic minimum cost path problem under \(L_1\) norm
- Minimum cost time-varying network flow problems
- An O(nm^ 2) time algorithm for solving minimal cost network flow problems
- Minimum Convex Cost Dynamic Network Flows
- scientific article; zbMATH DE number 3972590 (Why is no real title available?)
- scientific article; zbMATH DE number 4057258 (Why is no real title available?)
- scientific article; zbMATH DE number 150473 (Why is no real title available?)
- scientific article; zbMATH DE number 1984104 (Why is no real title available?)
- Minimum-cost dynamic flows: The series-parallel case
- A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
- A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices
- Minimum cost flow in a network with an underestimated arc capacity
- Efficient algorithm for minimum cost flow problem with partial lane reversals
- Minimum cost dynamic flows: the series-parallel case
- Finding the maximum flow of minimum cost in fuzzy dynamic network with a given vitality degree
- On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
- Minimum cost multicommodity flows in dynamic networks and algorithms for their findings
- Time-varying minimum cost flow problems
- Minimum‐cost flow problems having arc‐activation costs
- An introduction to dynamic generative networks: minimum cost flow
- Minimum flow problem on network flows with time-varying bounds
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4483658)
