An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions

DOI10.1002/nav.3800260405zbMath0496.90061OpenAlexW1497951585MaRDI QIDQ3960473

Clifford C. Peterson, Claude Dennis Pegden

Publication date: 1979

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

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

zbMATH Keywords

linear constraintstest problemscomputational experiencesolution algorithmBranch and Boundseparable nonlinear objective functiongeneralized Balas implicit enumeration scheme

Mathematics Subject Classification ID

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

Related Items (7)

A finite concave minimization algorithm using branch and bound and neighbor generation ⋮ A branch and search algorithm for a class of nonlinear knapsack problems ⋮ A branch and bound algorithm for solving a class of nonlinear integer programming problems ⋮ Reduction of nonlinear integer separable programming problems^∗ ⋮ Formulation for a fixed-charge, separable nonlinear production planning problem ⋮ A note on adapting methods for continuous global optimization to the discrete case ⋮ An algorithm for concave integer minimization over a polyhedron

Cites Work

• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Objective function approximations in mathematical programming
• An Algorithm for Nonlinear Knapsack Problems
• A hybrid approach to discrete mathematical programming
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• A Balasian-Based Algorithm for Zero-One Polynomial Programming

This page was built for publication: An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions