Monotone networks - MaRDI portal

Cited in

(71)

Resistance and conductance in structured Zermelo tournaments
An out-of-kilter method for the algebraic circulation problem
A strongly polynomial minimum cost circulation algorithm
Multiterminal duality and three-terminal series-parallelness
A nonliner congestion network model for planning internal movement in the Hajj
Penelope's graph: a hard minimum cost tension instance
The extremal length of a network
On the computational behavior of a polynomial-time network flow algorithm
Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems
Tight bounds on the number of minimum-mean cycle cancellations and related results
Morphisms and currents in infinite nonlinear resistive networks
Infinite nonlinear resistive networks, after Minty
Unicursal resistive networks
Efficient parallel algorithms for the minimum cost flow problem
Tension-flow polynomials on graphs
On extendibility of voltage and current regimes from subnetworks
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
A method with inertial extrapolation step for convex constrained monotone equations
Metric and ultrametric inequalities for directed graphs
Hemivariational inequalities on graphs
A modified Liu-Storey-conjugate descent hybrid projection method for convex constrained nonlinear equations and image restoration
Oscillations in mixed-feedback systems
A hybrid inertial algorithm for approximating solution of convex feasibility problems with applications
Duality for extended infinite monotropic optimization problems
On the convergence of sequence of maximal monotone operators of type (D) in Banach spaces
A theorem on maximal monotonic sets in Hilbert space
Unimodular modules
Dual complementary polynomials of graphs and combinatorial-geometric interpretation on the values of Tutte polynomial at positive integers
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
Convex programming and systems of elementary monotonic relations
Stability of systems with nonlinear damping
An approach for the convex feasibility problem via monotropic programming
Minimum-cost flow algorithms: an experimental evaluation
Linear passive systems and maximal monotone mappings
Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
Smoothed analysis of the successive shortest path algorithm
Graph-theoretic characterization of bifurcation phenomena in electrical circuit dynamics
Statistical procedures for estimating branch flows and total network flow
A “from scratch” proof of a theorem of Rockafellar and Fulkerson
Hydraulic network analysis using (generalized) geometric programming
The out‐of‐kilter algorithm for solving network problems
Transcritical bifurcation without parameters in memristive circuits
Random variables, monotone relations, and convex analysis
scientific article; zbMATH DE number 7390803 (Why is no real title available?)
Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
Sum of ultra maximal monotone operators and operators of type (D) in Grothendieck spaces
Duality in Countably Infinite Monotropic Programs
Monotone Optimierungsaufgaben
Flots et tensions dans un graphe
Metric and ultrametric spaces of resistances
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
Fifty years of maximal monotonicity
Circuit analysis using monotone+skew splitting
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
Duality in convex minimum cost flow problems on infinite networks and hypernetworks
Viscosity approximation for split monotone variational inclusions and fixed point problem
The geometry of monotone operator splitting methods
On the p-torsional rigidity of combinatorial graphs
Modelling of memristor networks and the effective memristor
Asymptotics of the p-capacity in the critical regime
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
M-accretive realisations of skew-symmetric operators
On the hardness of short and sign-compatible circuit walks
A parametric algorithm for convex cost network flow and related problems
Uncertain minimum cost flow problem
Resistances and currents in infinite electrical networks
Augmented nodal matrices and normal trees

This page was built for publication: Monotone networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3271631)