Non-linear integer programming

DOI10.1016/0898-1221(75)90020-6zbMath0332.90031OpenAlexW2028204728MaRDI QIDQ1228547

Leon Cooper, Mary W. Cooper

Publication date: 1975

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(75)90020-6

Mathematics Subject Classification ID

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

Related Items (4)

A branch and bound algorithm for solving separable convex integer programming problems ⋮ An improved algorithm for non-linear integer programming ⋮ Maximization of linearly constrained posynomials ⋮ A dynamic programming algorithm for multiple-choice constraints

Cites Work

• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
• Reducing the Memory Requirements of Dynamic Programming
• A New Decomposition Procedure for Dynamic Programming

This page was built for publication: Non-linear integer programming