Faster algorithms for the generalized network flow problem

DOI10.1287/MOOR.23.1.69MaRDI QIDQ2757524zbMATH OpenOpenAlexFDO

Authors Tomasz Radzik

Publication date 26 November 2001

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.23.1.69

zbMATH Keywords

network optimizationnetwork problemapproximate optimality conditionsgeneralized circulationgeneralized flow

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• New algorithms for generalized network flows
• Maximum network flows with concave gains
• TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
• Combinatorial approximation algorithms for generalized flow problems
• scientific article; zbMATH DE number 1187161

Cited in

(29)

• scientific article; zbMATH DE number 1187161 (Why is no real title available?)
• New algorithms for generalized network flows
• Combinatorial interior point methods for generalized network flow problems
• A simple GAP-canceling algorithm for the generalized maximum flow problem
• Multi-commodity flow problem on lossy network with partial lane reversals
• A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM
• On the relation of max-flow to min-cut for generalized networks
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• Improving time bounds on maximum generalised flow computations by contracting the network
• A fast algorithm for bounded generalized processing networks
• A new algorithm for general matching problems using network flow subproblems
• Maximum outflow in generalized flow networks
• Convex generalized flows
• Maximum flows in generalized processing networks
• A decomposition algorithm to determine the maximum flow in a generalized network
• A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
• scientific article; zbMATH DE number 2086656 (Why is no real title available?)
• scientific article; zbMATH DE number 1953081 (Why is no real title available?)
• Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
• A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
• Maximum network flows with concave gains
• Robust flows with losses and improvability in evacuation planning
• Greedy approximation algorithms for generalized maximum flow problem towards relation extraction in information networks
• An -relaxation method for generalized separable convex cost network flow problems
• Recognizing hidden bicircular networks
• Generalized max flow in series-parallel graphs
• The price of anarchy in series-parallel network congestion games
• Generalized maximum flow over time with intermediate storage

This page was built for publication: Faster algorithms for the generalized network flow problem

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