A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148)

From MaRDI portal

Revision as of 16:07, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A Strongly Polynomial Algorithm for Generalized Flow Maximization	scientific article

Statements

scholarly article

0 references

A Strongly Polynomial Algorithm for Generalized Flow Maximization (English)

0 references

Mathematics of Operations Research

0 references

publication date

13 April 2017

0 references

full work available at URL

http://eprints.lse.ac.uk/69679/1/Vegh_Strongly%20polynomial.pdf

0 references

zbMATH Keywords

network flow algorithms

0 references

generalized flows

0 references

strongly polynomial algorithms

0 references

linear programming

0 references

László A. Végh

0 references

MaRDI profile type

MaRDI publication profile

0 references

A Strongly Polynomial Algorithm for a Special Class of Linear Programs

0 references

New algorithms for generalized network flows

0 references

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

0 references

Fast and simple approximation schemes for generalized flow.

0 references

On the equivalence of some generalized network problems to pure network problems

0 references

Finding minimum-cost circulations by canceling negative cycles

0 references

Combinatorial Algorithms for the Generalized Circulation Problem

0 references

A Faster Combinatorial Algorithm for the Generalized Circulation Problem

0 references

Combinatorial interior point methods for generalized network flow problems

0 references

A polynomial dual simplex algorithm fot the generalized circulation problem.

0 references

Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem

0 references

Monotonizing linear programs with up to two nonzeroes per column

0 references

New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains

0 references

Mathematical Methods of Organizing and Planning Production

0 references

Speeding up Karmarkar's algorithm for multicommodity flows

0 references

Towards a Genuinely Polynomial Algorithm for Linear Programming

0 references

Optimum flows in general communication networks

0 references

A Faster Strongly Polynomial Minimum Cost Flow Algorithm

0 references

Max flows in O(nm) time, or better

0 references

Improving time bounds on maximum generalised flow computations by contracting the network

0 references

A simple GAP-canceling algorithm for the generalized maximum flow problem

0 references

A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)

0 references

A strongly polynomial minimum cost circulation algorithm

0 references

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs

0 references

On Max Flows with Gains and Pure Min-Cost Flows

0 references

Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

0 references

Concave Generalized Flows with Applications to Market Equilibria

0 references

A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow

0 references

Identifiers

zbMATH Open document ID

0 references

10.1287/moor.2016.0800

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2976148

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2976148&oldid=36316230"