Maximum network flows with concave gains

DOI10.1007/S10107-005-0608-1MaRDI QIDQ2492702zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Nonlinear optimizationGeneralized networksFlow algorithms

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Nonlinear programming (90C30)

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

• scientific article; zbMATH DE number 3989126 (Why is no real title available?)
• A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM
• An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
• Combinatorial Algorithms for the Generalized Circulation Problem
• Convex separable optimization is not much harder than linear optimization
• Faster algorithms for the generalized network flow problem
• Finding minimum-cost circulations by canceling negative cycles
• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
• Solving integer minimum cost flows with separable convex cost objective polynomially
• TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM

Cited in

(14)

• scientific article; zbMATH DE number 5885647 (Why is no real title available?)
• 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)
• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 5371757 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 706868 (Why is no real title available?)
• 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)