Access the full text.
Sign up today, get DeepDyve free for 14 days.
Atthakorn Glankwahmdee, J. Liebman, G. Hogg (1979)
UNCONSTRAINED DISCRETE NONLINEAR PROGRAMMINGEngineering Optimization, 4
B. Faaland (1974)
An Integer Programming Algorithm for Portfolio SelectionManagement Science, 20
Yuji Nakagawa, K. Nakashima, Y. Hattori (1978)
Optimal Reliability Allocation by Branch-and-Bound TechniqueIEEE Transactions on Reliability, R-27
S. Vajda (1970)
Integer Programming and Network Flows
T. Morin, R. Marsten (1976)
An Algorithm for Nonlinear Knapsack ProblemsManagement Science, 22
M. Grunspan, M. Thomas (1973)
Hyperbolic integer programmingNaval Research Logistics Quarterly, 20
P. Hansen (1979)
Methods of Nonlinear 0-1 ProgrammingAnnals of discrete mathematics, 5
H. Salkin (1975)
Integer ProgrammingOptimizations and Programming
J. Abadie, H. Dayan, J. Akoka (1976)
Quelques expériences numériques sur la programmation non linéaire en nombres entiers, 10
Prabhakant Sinha, A. Zoltners (1979)
The Multiple-Choice Knapsack ProblemOper. Res., 27
R. Meyer (1977)
A Class of Nonlinear Integer Programs Solvable by a Single Linear ProgramSiam Journal on Control and Optimization, 15
Mary Cooper (1980)
The use of dynamic programming methodology for the solution of a class of nonlinear programming problemsNaval Research Logistics Quarterly, 27
Jonathan Yormark (1979)
Efficient Frontiers for Nonlinear Multidimensional Knapsack Problems.
G. Dantzig (1965)
Linear programming and extensionsThe Mathematical Gazette, 49
E. Balas (1969)
Duality in Discrete Programming: II. The Quadratic CaseManagement Science, 16
James Mao, B. Wallingford (1968)
An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital BudgetingManagement Science, 15
E. Denardo, B. Fox (1979)
Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOper. Res., 27
C. Pegden, C. Petersen (1979)
An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functionsNaval Research Logistics Quarterly, 26
P. Hammer, S. Rudeanu (1968)
Boolean Methods in Operations Research and Related Areas
C. Witzgall (1963)
AN ALL-INTEGER PROGRAMMING ALGORITHM WITH PARABOLIC CONSTRAINTS*Journal of The Society for Industrial and Applied Mathematics, 11
Monique Guignard (1971)
Brèves communications. Une condition d'optimalité en programmation en nombres entiers, 5
W. Krelle, B. Korte, W. Oberhofer (1970)
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger ProgrammierungsaufgabenUnternehmensforschung, 14
E. Lawler, M. Bell (1966)
A Method for Solving Discrete Optimization ProblemsOper. Res., 14
B. Miller (1971)
On Minimizing Nonseparable Functions Defined on the Integers with an Inventory ApplicationSiam Journal on Applied Mathematics, 21
T. Morin (1978)
COMPUTATIONAL ADVANCES IN DYNAMIC PROGRAMMING
Irinel Dragan (1968)
Un algorithme lexicographique pour la résolution des programmes polynomiaux en variables entières, 2
J. Kelley (1960)
The Cutting-Plane Method for Solving Convex ProgramsJournal of The Society for Industrial and Applied Mathematics, 8
D. Sweeney, Richard Murphy (1979)
A Method of Decomposition for Integer ProgramsOper. Res., 27
R. Aust (1976)
A dynamic programming branch and bound algorithm for pure integer programmingComput. Oper. Res., 3
The subject of this paper is a classification and discussion of algorithms for solution of nonlinear pure integer programming problems. The survey is organized by characterizing the mathematical form of the nonlinear optimization problems addressed by the various algorithms. If any method can be used without changes to solve mixed integer nonlinear programming problems that fact is mentioned in the description of the algorithm. However algorithms which must be applied only to mixed integer problems are not surveyed.
Management Science – INFORMS
Published: Mar 1, 1981
Keywords: Keywords : programming: integer nonlinear algorithm
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.