scientific article; zbMATH DE number 66616

MaRDI QIDQ4011249zbMATH OpenFDO

Authors Éva Tardos

Publication date 27 September 1992

zbMATH Keywords

Diophantine approximationstrongly polynomial\(\varepsilon\)-optimality

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A strongly polynomial algorithm for generalized flow maximization
• A strongly polynomial algorithm for generalized flow maximization
• An application of simultaneous diophantine approximation in combinatorial optimization
• A simpler and faster strongly polynomial algorithm for generalized flow maximization

Cited in

(4)

• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
• Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S
• An application of simultaneous diophantine approximation in combinatorial optimization

This page was built for publication:

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