A new exact algorithm for concave knapsack problems with integer variables

DOI10.1080/00207160.2017.1418505MaRDI QIDQ5031798zbMATH OpenOpenAlexFDO

Authors 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 problemcontour cutlinear underestimationspecial cut

Mathematics Subject Classification ID

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

Recommendations

• Exact algorithm for concave knapsack problems: linear underestimation and partition method
• On the solution of concave knapsack problems
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• An exact algorithm for the Knapsack problem with setup
• Dynamic programming algorithm with objective level cut for nonlinear knapsack problem

Cites work

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

Cited in

(8)

• 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
• An exact algorithm for linear integer programming problems with distributionally robust chance constraints
• A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
• A general purpose exact solution method for mixed integer concave minimization problems
• Hyperrectangular partition schemes for two-stage stochastic linear mixed integer programming problems
• Exact algorithm for concave knapsack problems: linear underestimation and partition method
• A new exact algorithm for general orthogonal d-dimensional knapsack problems

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

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