Combinatorial Algorithms for the Generalized Circulation Problem
From MaRDI portal
Publication:3362078
DOI10.1287/moor.16.2.351zbMath0734.90029OpenAlexW2048441979MaRDI QIDQ3362078
Andrew V. Goldberg, Éva Tardos, Serge A. Plotkin
Publication date: 1991
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/464bb89ebbc88642d00b97ba77c6654e775459c5
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Recognizing a class of bicircular matroids ⋮ Improving time bounds on maximum generalised flow computations by contracting the network ⋮ A faster combinatorial approximation algorithm for scheduling unrelated parallel machines ⋮ Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains ⋮ Win-win match using a genetic algorithm ⋮ Shortest path and maximum flow problems in networks with additive losses and gains ⋮ Multi-commodity flow problem on lossy network with partial lane reversals ⋮ A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ Unnamed Item ⋮ Generalized max flow in series-parallel graphs ⋮ An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ Currency arbitrage detection using a binary integer programming model ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ Maximum network flows with concave gains ⋮ Uncovering generalized-network structure in matrices ⋮ Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations ⋮ Convex generalized flows
