Nonlinear integer programming for various forms of constraints

DOI10.1002/NAV.3800290406zbMath0538.90066OpenAlexW2039534446MaRDI QIDQ3325471

Keyvan Farhangian, Mary W. Cooper

Publication date: 1982

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800290406

zbMATH Keywords

performance analysisfathomingcomputational investigationSeparability of the objective functionvarious types of constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Dynamic programming (90C39)

Related Items (6)

Identifying a global optimizer with filled function for nonlinear integer programming ⋮ Models and methods of solution of quadratic integer programming problems ⋮ Finding discrete global minima with a filled function for integer programming ⋮ Discrete filled function method for discrete global optimization ⋮ A continuous approach to nonlinear integer programming ⋮ A dynamic programming algorithm for multiple-choice constraints

Cites Work

• Quadratic knapsack problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonlinear integer programming for various forms of constraints