Maximum network flows with concave gains
From MaRDI portal
Publication:2492702
DOI10.1007/S10107-005-0608-1zbMATH Open1111.90107OpenAlexW2041444488MaRDI QIDQ2492702FDOQ2492702
Authors: Maiko Shigeno 
Publication date: 14 June 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0608-1
Recommendations
- Faster algorithms for the generalized network flow problem
- A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
- scientific article; zbMATH DE number 706868
- Convex generalized flows
- Concave generalized flows with applications to market equilibria
Cites Work
- Finding minimum-cost circulations by canceling negative cycles
- Title not available (Why is that?)
- Faster algorithms for the generalized network flow problem
- Convex separable optimization is not much harder than linear optimization
- Combinatorial Algorithms for the Generalized Circulation Problem
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
- Solving integer minimum cost flows with separable convex cost objective polynomially
- TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
- An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
- A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM
Cited In (14)
- Title not available (Why is that?)
- Maximum bipartite flow in networks with adaptive channel width
- Faster algorithms for the generalized network flow problem
- Convex generalized flows
- A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
- Incremental network design with maximum flows
- Shortest path and maximum flow problems in networks with additive losses and gains
- Maximum Bipartite Flow in Networks with Adaptive Channel Width
- Title not available (Why is that?)
- Maximum balanced flow in a network
- Necessary and sufficient condition for non-concave network utility maximisation
This page was built for publication: Maximum network flows with concave gains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492702)
