New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains

DOI10.1287/opre.10.4.476zbMath0109.38203OpenAlexW1993496017MaRDI QIDQ3847859

William S. Jewell

Publication date: 1962

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.10.4.476

zbMATH Keywords

applications of probability theory and statistics

Related Items (31)

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines ⋮ Smoothed Analysis of the Successive Shortest Path Algorithm ⋮ Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm ⋮ 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 ⋮ Shortest path and maximum flow problems in networks with additive losses and gains ⋮ Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen ⋮ Optimization of the flow through networks with gains ⋮ Solving the resource constrained deadline scheduling problem via reduction to the network flow problem ⋮ Multi-commodity flow problem on lossy network with partial lane reversals ⋮ Deterministic discrete dynamic programming with discount factor greater than one: Some further results and algorithms ⋮ Devisenarbitrage als Flußprobleme ⋮ The structure of bases in bicircular matroids ⋮ On the equivalence of some generalized network problems to pure network problems ⋮ A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ Decomposition of group flows in regular matroids ⋮ Optimal cocircuits in regular matroids and applications ⋮ Convexification of generalized network flow problem ⋮ An approach to the modeling and analysis of multiobjective generalized networks ⋮ Updating network flows given multiple, heterogeneous arc attribute changes ⋮ Resilient distributed optimal generation dispatch for lossy AC microgrids ⋮ An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ On the dual coordinate ascent approach for nonlinear networks ⋮ Min-Cost Flow in Unit-Capacity Planar Graphs ⋮ Optimum flows in general communication networks ⋮ Network flows with age dependent decay rates ⋮ On the dual of the solvency cone ⋮ An exterior point simplex algorithm for (general) linear programming problems ⋮ Mathematical programming applied to load flow calculations ⋮ Convex generalized flows

This page was built for publication: New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains