scientific article; zbMATH DE number 432784

MaRDI QIDQ3138915zbMATH OpenFDO

Authors Carolyn Haibt Norton, Éva Tardos, Serge Plotkin

Publication date 19 September 1994

zbMATH Keywords

convex setsseparation algorithmsconcurrent multi-commodity flow problem

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Cited in

(5)

• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
• Polynomial algorithms for linear programming over the algebraic numbers
• Point location in zones of \(k\)-flats in arrangements
• Algorithms and complexity analysis for some flow problems
• \(\varepsilon\)-approximation minimization of convex functions in fixed dimension

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 Q3138915)