A new exact algorithm for concave knapsack problems with integer variables

DOI10.1080/00207160.2017.1418505zbMath1499.90189OpenAlexW2794003322MaRDI QIDQ5031798

Fenlan Wang

Publication date: 16 February 2022

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2017.1418505

zbMATH Keywords

branch-and-boundconcave knapsack problemlinear underestimationcontour cutspecial cut

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items (4)

New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming ⋮ A new algorithm for quadratic integer programming problems with cardinality constraint ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ An exact algorithm for linear integer programming problems with distributionally robust chance constraints

Cites Work

• Unnamed Item
• A branch and search algorithm for a class of nonlinear knapsack problems
• Exact algorithm for concave knapsack problems: linear underestimation and partition method
• An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
• The nonlinear knapsack problem - algorithms and applications
• A nonlinear knapsack problem
• A note on adapting methods for continuous global optimization to the discrete case
• An algorithm for concave integer minimization over a polyhedron
• Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• Branch-and-Bound Strategies for Dynamic Programming
• A hybrid approach to discrete mathematical programming
• An algorithm and new penalties for concave integer minimization over a polyhedron
• The Nonlinear Resource Allocation Problem
• Introduction to global optimization.
• A pegging algorithm for the nonlinear resource allocation problem

This page was built for publication: A new exact algorithm for concave knapsack problems with integer variables