A nonlinear knapsack problem
From MaRDI portal
Publication:1905070
DOI10.1016/0167-6377(95)00009-9zbMath0838.90092OpenAlexW2097155690MaRDI QIDQ1905070
Publication date: 16 January 1996
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(95)00009-9
fully polynomial approximation schemenonlinear knapsack\(\varepsilon\)-accurate solutionseparable concave objective function
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (37)
A new exact algorithm for concave knapsack problems with integer variables ⋮ Maximum likelihood estimation of cell probabilities in constrained multinomial models ⋮ A biobjective method for sample allocation in stratified sampling ⋮ On a nonseparable convex maximization problem with continuous Knapsack constraints ⋮ Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints ⋮ A particle swarm optimization approach to the nonlinear resource allocation problem ⋮ Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling ⋮ Competitive facility location model with concave demand ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ An exact algorithm for linear integer programming problems with distributionally robust chance constraints ⋮ Construction of efficient experimental designs under multiple resource constraints ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ An exact algorithm for cost minimization in series reliability systems with multiple component choices ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Nonconvex piecewise linear knapsack problems ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ Supermodular covering knapsack polytope ⋮ The packing while traveling problem ⋮ Solving knapsack problems with \(S\)-curve return functions ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique ⋮ A branch-and-bound based method for solving monotone optimization problems ⋮ On speed scaling via integer programming ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems ⋮ An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems ⋮ Distance confined path problem and separable integer programming ⋮ The submodular knapsack polytope ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ An approximate dynamic programming approach to convex quadratic knapsack problems ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method ⋮ Exact solution of a class of nonlinear knapsack problems ⋮ Nonlinear integer programming for optimal allocation in stratified sampling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and search algorithm for a class of nonlinear knapsack problems
- An O(n) algorithm for quadratic knapsack problems
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Solving certain singly constrained convex optimization problems in production planning
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Fast Approximation Algorithms for Knapsack Problems
- Technical Note—Allocation of Effort Resources among Competing Activities
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- An Algorithm for Nonlinear Knapsack Problems
- A hybrid approach to discrete mathematical programming
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- Convex separable optimization is not much harder than linear optimization
This page was built for publication: A nonlinear knapsack problem
