A Survey of Methods for Pure Nonlinear Integer Programming

DOI10.1287/MNSC.27.3.353zbMath0453.90067OpenAlexW1980522505MaRDI QIDQ3901304

Mary W. Cooper

Publication date: 1981

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.27.3.353

zbMATH Keywords

surveyalgorithmssolution methodsnonlinear pure integer programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (26)

An extended continuous maximal covering location problem with facility placement ⋮ Binary Optimal Control of Single-Flux-Quantum Pulse Sequences ⋮ A branch and bound algorithm for solving separable convex integer programming problems ⋮ A new node selection strategy in the branch-and-bound procedure ⋮ Exact solution method to solve large scale integer quadratic multidimensional knapsack problems ⋮ Graph separation techniques for quadratic zero-one programming ⋮ Capacity planning in networks of queues with manufacturing applications ⋮ Computational aspects of a branch and bound algorithm for quadratic zero- one programming ⋮ An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming ⋮ A branch and search algorithm for a class of nonlinear knapsack problems ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Some algebraic methods for solving multiobjective polynomial integer programs ⋮ An exact algorithm for linear integer programming problems with distributionally robust chance constraints ⋮ Logarithmic-exponential penalty formulation for integer programming ⋮ Models and methods of solution of quadratic integer programming problems ⋮ Reduction of nonlinear integer separable programming problems^∗ ⋮ Discrete optimization by optimal control methods. I: Separable problems ⋮ An efficient algorithm for multi-dimensional nonlinear knapsack problems ⋮ Discrete filled function method for discrete global optimization ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems ⋮ A real coded genetic algorithm for solving integer and mixed integer optimization problems ⋮ A constrained nonlinear 0-1 program for data allocation ⋮ Conjugate duality and the curse of dimensionality ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method ⋮ Nonlinear integer programming for optimal allocation in stratified sampling

This page was built for publication: A Survey of Methods for Pure Nonlinear Integer Programming