An all integer method for integer convex programs

DOI10.1080/02331938008842635zbMATH Open0514.90064OpenAlexW2155932672MaRDI QIDQ3661319FDOQ3661319

M. Chandramohan, Suresh Chandra

Publication date: 1980

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938008842635

zbMATH Keywords

convex polynomials with rational coefficientsfinite all-integer methodinteger convex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55) Integer programming (90C10)

This page was built for publication: An all integer method for integer convex programs

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