Exact algorithm for concave knapsack problems: linear underestimation and partition method
From MaRDI portal
Publication:811881
DOI10.1007/s10898-005-1678-6zbMath1093.90050OpenAlexW1990425461WikidataQ57445502 ScholiaQ57445502MaRDI QIDQ811881
Publication date: 23 January 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-005-1678-6
nonlinear integer programmingdomain partitionconcave knapsack problemdomain cutlinear underestimation
Related Items (6)
A new exact algorithm for concave knapsack problems with integer variables ⋮ 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 ⋮ An exact algorithm for cost minimization in series reliability systems with multiple component choices ⋮ Solving knapsack problems with \(S\)-curve return functions ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems
Cites Work
- A branch and search algorithm for a class of nonlinear knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A note on a general nonlinear knapsack problem
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- The nonlinear knapsack problem - algorithms and applications
- Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems
- A nonlinear knapsack problem
- A note on adapting methods for continuous global optimization to the discrete case
- Algorithms for Separable Nonlinear Resource Allocation Problems
- An algorithm for concave integer minimization over a polyhedron
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- Reduction of nonlinear integer separable programming problems∗
- A Survey of Methods for Pure Nonlinear Integer Programming
- Branch-and-Bound Strategies for Dynamic Programming
- An Algorithm for Nonlinear Knapsack Problems
- A hybrid approach to discrete mathematical programming
- An algorithm and new penalties for concave integer minimization over a polyhedron
- The Nonlinear Resource Allocation Problem
- A pegging algorithm for the nonlinear resource allocation problem
This page was built for publication: Exact algorithm for concave knapsack problems: linear underestimation and partition method
