Monotone networks
From MaRDI portal
Publication:3271631
DOI10.1098/rspa.1960.0144zbMath0093.42106OpenAlexW4253576536MaRDI QIDQ3271631
Publication date: 1960
Published in: Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rspa.1960.0144
Related Items
A strongly polynomial minimum cost circulation algorithm, Metric and ultrametric inequalities for directed graphs, Flots et tensions dans un graphe, An approach for the convex feasibility problem via monotropic programming, Multiterminal duality and three-terminal series-parallelness, Linear passive systems and maximal monotone mappings, Hemivariational inequalities on graphs, Smoothed Analysis of the Successive Shortest Path Algorithm, Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm, Unnamed Item, Infinite nonlinear resistive networks, after Minty, Unicursal resistive networks, A theorem on maximal monotonic sets in Hilbert space, Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm, A modified Liu-Storey-conjugate descent hybrid projection method for convex constrained nonlinear equations and image restoration, A nonliner congestion network model for planning internal movement in the Hajj, Oscillations in mixed-feedback systems, Fifty years of maximal monotonicity, Efficient parallel algorithms for the minimum cost flow problem, Penelope's graph: a hard minimum cost tension instance, Minimum-cost flow algorithms: an experimental evaluation, The extremal length of a network, Uncertain minimum cost flow problem, Circuit analysis using monotone+skew splitting, A survey on exact algorithms for the maximum flow and minimum‐cost flow problems, Duality in Countably Infinite Monotropic Programs, Transcritical Bifurcation without Parameters in Memristive Circuits, A hybrid inertial algorithm for approximating solution of convex feasibility problems with applications, Unimodular modules, A “from scratch” proof of a theorem of Rockafellar and Fulkerson, Dual complementary polynomials of graphs and combinatorial-geometric interpretation on the values of Tutte polynomial at positive integers, Tension-flow polynomials on graphs, Resistances and currents in infinite electrical networks, The out‐of‐kilter algorithm for solving network problems, Metric and ultrametric spaces of resistances, Random variables, monotone relations, and convex analysis, Duality for extended infinite monotropic optimization problems, On the computational behavior of a polynomial-time network flow algorithm, Statistical procedures for estimating branch flows and total network flow, GRAPH-THEORETIC CHARACTERIZATION OF BIFURCATION PHENOMENA IN ELECTRICAL CIRCUIT DYNAMICS, Hydraulic network analysis using (generalized) geometric programming, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Convergent Lagrangian heuristics for nonlinear minimum cost network flows, Augmented nodal matrices and normal trees, Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems, Mass conserved elementary kinetics is sufficient for the existence of a non-equilibrium steady state concentration, Strong convergence of an inertial algorithm for maximal monotone inclusions with applications, Convex programming and systems of elementary monotonic relations, Stability of systems with nonlinear damping, Unnamed Item, On Algorithms for Difference of Monotone Operators, On Algorithms for Difference of Monotone Operators, Global homeomorphism of vector-valued functions, Global homeomorphism of vector-valued functions, A method with inertial extrapolation step for convex constrained monotone equations, Resistance and conductance in structured Zermelo tournaments, On the convergence of sequence of maximal monotone operators of type (D) in Banach spaces, On extendibility of voltage and current regimes from subnetworks, A parametric algorithm for convex cost network flow and related problems, An out-of-kilter method for the algebraic circulation problem, Monotone Optimierungsaufgaben, Tight bounds on the number of minimum-mean cycle cancellations and related results, Morphisms and currents in infinite nonlinear resistive networks
