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

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

Claude Dennis Pegden, Clifford C. Peterson

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 constraints; test problems; computational experience; solution algorithm; Branch and Bound; separable nonlinear objective function; generalized Balas implicit enumeration scheme

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C30: Nonlinear programming

Related Items

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

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