A Survey of Methods for Pure Nonlinear Integer Programming

DOI10.1287/MNSC.27.3.353MaRDI QIDQ3901304zbMATH OpenOpenAlexFDO

Authors 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

algorithmsnonlinear pure integer programmingsolution methodssurvey

Mathematics Subject Classification ID

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

Cited in

(26)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3901304)