scientific article; zbMATH DE number 4193457

MaRDI QIDQ5202029zbMATH OpenFDO

Authors Alexander Ageev

Publication date 1988

zbMATH Keywords

concave separable functionsnonlinear integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 3873086
• scientific article; zbMATH DE number 4130189
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Convex separable optimization is not much harder than linear optimization
• scientific article; zbMATH DE number 4099035

Cited in

(5)

• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• scientific article; zbMATH DE number 4130189 (Why is no real title available?)
• scientific article; zbMATH DE number 3873086 (Why is no real title available?)
• scientific article; zbMATH DE number 4099035 (Why is no real title available?)
• scientific article; zbMATH DE number 1985658 (Why is no real title available?)

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