scientific article; zbMATH DE number 910862

MaRDI QIDQ4886036zbMATH OpenFDO

Authors Alexander V. Karzanov, S. Thomas McCormick

Publication date 28 July 1996

zbMATH Keywords

geometric convergenceseparable convex objective functioncancel and tighten methodminimum linear cost circulationperfect bipartite matching polytope

Mathematics Subject Classification ID

Convex programming (90C25) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• A polynomial-time descent method for separable convex optimization problems with linear constraints
• Solving integer minimum cost flows with separable convex cost objective polynomially
• Convex separable optimization is not much harder than linear optimization
• Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

Cited in

(6)

• A note on nonconvex minimax theorem with separable homogeneous polynomials
• Using separation algorithms in fixed dimension
• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• A strongly polynomial algorithm for the minimum cost tension problem
• A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
• Univariate polynomial optimization with sum-of-squares interpolants

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