Exact algorithm for concave knapsack problems: linear underestimation and partition method
From MaRDI portal
Recommendations
- A new exact algorithm for concave knapsack problems with integer variables
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- On the solution of concave knapsack problems
- A unified method for a class of convex separable nonlinear knapsack problems
- An exact algorithm for the Knapsack problem with setup
Cites work
- A Survey of Methods for Pure Nonlinear Integer Programming
- 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 a general 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
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- Algorithms for separable nonlinear resource allocation problems
- An Algorithm for Nonlinear Knapsack Problems
- An algorithm and new penalties for concave integer minimization over a polyhedron
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- 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
- Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems
- Reduction of nonlinear integer separable programming problems∗
- The Nonlinear Resource Allocation Problem
- The nonlinear knapsack problem - algorithms and applications
Cited in
(6)- Solving knapsack problems with \(S\)-curve return functions
- A general purpose exact solution method for mixed integer concave minimization problems
- Surrogate dual method for multi-dimensional nonlinear knapsack problems
- An exact algorithm for cost minimization in series reliability systems with multiple component choices
- A new exact algorithm for concave knapsack problems with integer variables
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints
This page was built for publication: Exact algorithm for concave knapsack problems: linear underestimation and partition method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811881)
