An Algorithm for Nonlinear Knapsack Problems

DOI10.1287/MNSC.22.10.1147zbMATH Open0357.90045OpenAlexW2125718451MaRDI QIDQ4133409FDOQ4133409

Authors Thomas Morin, Roy E. Marsten 

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) Nonlinear programming (90C30) Integer programming (90C10) Hamilton-Jacobi theories (49L99)

Cited in

(28)

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

This page was built for publication: An Algorithm for Nonlinear Knapsack Problems

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