New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
From MaRDI portal
Cited in
(33)- Network flows with age dependent decay rates
- Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen
- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
- Decomposition of group flows in regular matroids
- Optimal cocircuits in regular matroids and applications
- An approach to the modeling and analysis of multiobjective generalized networks
- On the dual coordinate ascent approach for nonlinear networks
- An exterior point simplex algorithm for (general) linear programming problems
- Convexification of generalized network flow problem
- Resilient distributed optimal generation dispatch for lossy AC microgrids
- On the dual of the solvency cone
- Convex generalized flows
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Optimum flows in general communication networks
- A strongly polynomial algorithm for generalized flow maximization
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- Smoothed analysis of the successive shortest path algorithm
- Deterministic discrete dynamic programming with discount factor greater than one: Some further results and algorithms
- Devisenarbitrage als Flußprobleme
- An -relaxation method for generalized separable convex cost network flow problems
- Mathematical programming applied to load flow calculations
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
- Optimization of the flow through networks with gains
- On the equivalence of some generalized network problems to pure network problems
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- Multi-commodity flow problem on lossy network with partial lane reversals
- Shortest path and maximum flow problems in networks with additive losses and gains
- Generalized maximum flow over time with intermediate storage
- Updating network flows given multiple, heterogeneous arc attribute changes
- Shortest two disjoint paths in conservative graphs
- The structure of bases in bicircular matroids
This page was built for publication: New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3847859)
