A Survey of Methods for Pure Nonlinear Integer Programming

Mary W. Cooper · Management Science · 1981

Summary

A classification and discussion of algorithms for solution of nonlinear pure integer programming problems and characterizing the mathematical form of the nonlinear optimization problems addressed by the various algorithms.

Type: article
Published: 1981-03-01
Cited by: 77
References: 29
DOI: https://doi.org/10.1287/mnsc.27.3.353
OpenAlex: https://openalex.org/W1980522505
Semantic Scholar: https://api.semanticscholar.org/CorpusID:120741507

Keywords

Integer programming, Integer (computer science), Nonlinear programming, Mathematical optimization, Nonlinear system

References

An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functionsC. Dennis Pegden, Clifford C. Petersen — 1979
Integer Programming and Network FlowsS. Vajda — 1970
Efficient Frontiers for Nonlinear Multidimensional Knapsack Problems.Jonathan S. Yormark — 1979
An Integer Programming Algorithm for Portfolio SelectionBruce Faaland — 1974
Boolean Methods in Operations Research and Related AreasPeter L. Hammer, Sergiu Rudeanu — 1968
A Class of Nonlinear Integer Programs Solvable by a Single Linear ProgramR. R. Meyer — 1977
AN ALL-INTEGER PROGRAMMING ALGORITHM WITH PARABOLIC CONSTRAINTS*Christoph Witzgall — 1963
A dynamic programming branch and bound algorithm for pure integer programmingR. J. Aust — 1976
Hyperbolic integer programmingMarcel Grunspan, Michael E. Thomas — 1973
UNCONSTRAINED DISCRETE NONLINEAR PROGRAMMINGAtthakorn Glankwahmdee, Judith S. Liebman, Gary L. Hogg — 1979
A Method of Decomposition for Integer ProgramsDennis J. Sweeney, Richard A. Murphy — 1979
On Minimizing Nonseparable Functions Defined on the Integers with an Inventory ApplicationBruce L. Miller — 1971
The Cutting-Plane Method for Solving Convex ProgramsJames E. Kelley — 1960
Shortest-Route Methods: 1. Reaching, Pruning, and BucketsEric V. Denardo, Bennett L. Fox — 1979
The use of dynamic programming methodology for the solution of a class of nonlinear programming problemsMary W. Cooper — 1980
An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital BudgetingJames C. T. Mao, B. A. Wallingford — 1968
A Method for Solving Discrete Optimization ProblemsEugene L. Lawler, M. D. Bell — 1966
An Algorithm for Nonlinear Knapsack ProblemsThomas L. Morin, Roy E. Marsten — 1976
The Multiple-Choice Knapsack ProblemPrabhakant Sinha, Andris A. Zoltners — 1979
Optimal Reliability Allocation by Branch-and-Bound TechniqueYuji Nakagawa, Kyoichi Nakashima, Yoshio Hattori — 1978

Cited by

Pengembangan Algoritma Pencarian Untuk Menyelesaikan Problema Program Taklinier Integer campuranJuandi Sidabutar — 2008
Computational aspects of a branch and bound algorithm for quadratic zero-one programmingPãnos M. Pardalos, Gregory Rodgers — 1990
A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization ProblemsChilukuri K. Mohan, H.T. Nguyen — 1999
Engineering Optimization : Theory and PracticeSingiresu S. Rao — 2010
Success Guarantee of Dual Search in Integer Programming: p-th Power Lagrangian MethodDuan Li, Xiaoling Sun — 2000
A Class of Direct Search Methods for Nonlinear Integer ProgrammingStephen Sugden — 1992
Statistical Verification and Optimization of Integrated CircuitsYu Ben — 2011
On the resolution of the system of fuzzy Diophantine equationsF.-B. Liu, Cheng-Feng Hu — 2014
A constrained nonlinear 0–1 program for data allocationRathindra Sarathy, Bala Shetty, Arun Sen — 1997
Nonlinear integer programming for optimal allocation in stratified samplingKurt M. Bretthauer, Anthony Ross, Bala Shetty — 1999
Chart allocation strategy for serial-parallel multistage manufacturing processesMing Jin, Yanting Li, Fugee Tsung — 2010
On the optimum design of symmetric two‐dimensional IIR digital filters with coefficients of finite word lengthN. Papamarkos, B.G. Mertzios, George Vachtsevanos — 1986
Surrogate dual method for multi-dimensional nonlinear knapsack problemsShanshan Kong, Xiaoling Sun — 2007
Convergent Lagrangian and domain cut method for nonlinear knapsack problemsDuan Li, Xiaoling Sun, J. Wang — 2009
Discrete optimization by optimal control methods I. Separable problemsS. I. Sergeev — 2006
A DSS to manage platelet production supply chain for regional blood centersParviz Ghandforoush, Tarun K. Sen — 2010
An extended continuous maximal covering location problem with facility placementA. Mehrez, Ariel Stulman — 1984
Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective FunctionDuan Li, Xiao Sun, F. L. Wang — 2006
A branch and bound algorithm for solving separable convex integer programming problemsWon Jin Lee, A. Victor Cabot, M.A. Venkataramanan — 1994
Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition MethodXiaoling Sun, F. L. Wang, Duan Li — 2005

A Survey of Methods for Pure Nonlinear Integer Programming

Summary

Keywords

References

Cited by

Related papers