A hybrid method for solving nonlinear knapsack problems

DOI10.1016/0377-2217(89)90109-4zbMath0676.90047OpenAlexW1969563341MaRDI QIDQ1123129

Frank Koerner

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90109-4

zbMATH Keywords

nonlinear integer programmingbranch-and-boundsubgradient algorithmsurrogate problem

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Dynamic programming (90C39)

Related Items (6)

Unnamed Item ⋮ An efficient algorithm for multi-dimensional nonlinear knapsack problems ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems ⋮ On duality for Boolean programming ⋮ An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and search algorithm for a class of nonlinear knapsack problems
• A new look at Bellman's principle of optimality
• Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator)
• A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
• Methods of Nonlinear 0-1 Programming
• Calculating surrogate constraints
• Untersuchungen über eine günstige verzweigungsreihenfolge der variablen bei branch and bound-verfahren
• Branch-and-Bound Strategies for Dynamic Programming
• An Algorithm for Nonlinear Knapsack Problems
• Verfahren znr lösung ganzzahliger nichtlinearer optimierungsprobleme
• A hybrid approach to discrete mathematical programming

This page was built for publication: A hybrid method for solving nonlinear knapsack problems