scientific article; zbMATH DE number 3873086

MaRDI QIDQ3340633zbMATH OpenFDO

Authors N. I. Glebov

Publication date 1983

zbMATH Keywords

algorithminteger polymatroidsseparable function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4193457
• scientific article; zbMATH DE number 647670
• scientific article; zbMATH DE number 5319970
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• On Convex Minimization over Base Polytopes

Cited in

(10)

• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Equivalence of convex minimization problems over base polytopes
• scientific article; zbMATH DE number 4130189 (Why is no real title available?)
• scientific article; zbMATH DE number 4202022 (Why is no real title available?)
• scientific article; zbMATH DE number 4008135 (Why is no real title available?)
• scientific article; zbMATH DE number 647670 (Why is no real title available?)
• A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER AN INTEGRAL BISUBMODULAR POLYHEDRON
• scientific article; zbMATH DE number 4193457 (Why is no real title available?)
• On Convex Minimization over Base Polytopes
• A note on nonconvex minimax theorem with separable homogeneous polynomials

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