An Algorithm for Nonlinear Knapsack Problems

DOI10.1287/mnsc.22.10.1147zbMath0357.90045OpenAlexW2125718451MaRDI QIDQ4133409

Roy E. Marsten, Thomas L. Morin

Publication date: 1976

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Hamilton-Jacobi theories (49L99)

Related Items

A branch and bound algorithm for solving separable convex integer programming problems, A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem, A nonlinear knapsack problem, Theory and applications of generalized dynamic programming: An overview, A hybrid method for solving nonlinear knapsack problems, Stability, parametric, and postoptimality analysis of discrete optimization problems, An improved algorithm for non-linear integer programming, Optimization of spare parts for hierarchically decomposable systems, A solution procedure for general knapsack problems with a few constraints, Ersatzteilbemessung für reparierbare Geräte. Grundlegende Modelle und Verfahren, Multicriteria dynamic programming with an application to the integer case, An exact algorithm for linear integer programming problems with distributionally robust chance constraints, An interactive dynamic programming approach to multicriteria discrete programming, Supermodular covering knapsack polytope, Solving knapsack problems with \(S\)-curve return functions, The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions, An exact penalty function approach for nonlinear integer programming problems, Computational experiments with a class of dynamic programming algorithms of higher dimensions, A hybrid approach to discrete mathematical programming, The Collapsing 0–1 Knapsack Problem, A Reach and Bound algorithm for acyclic dynamic-programming networks, The submodular knapsack polytope, A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints, Conjugate duality and the curse of dimensionality, Exact algorithm for concave knapsack problems: linear underestimation and partition method, An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions