On a discrete nonlinear and nonseparable knapsack problem
The author considers a problem of the type \[ (EXI):\;\text{ minimize } f(\hat x)=\sum_{j\in A}(p^*_ j-p_ j)\cdot \exp (-\sum_{k\in K}d_{jk}x_ k) \] subject to \(\sum \beta_ kx_ k\leq B\), \(x_ k=0,1,2,...\), \(\forall k\in K\), where \(p_ j\) is the initial probability and \(p^*_ j\) is the limiting probability \((p^*_ j>p_ j)\). This problem with \(x_ k\geq 0\), \(\forall k\in K\), and \(\sum \beta_ kx_ k=B\), is of the type (EX). To solve problem (EX), the quadratic knapsack problem (EXQ) is considered. On the basis of an algorithm solving (EX) a branch-and-bound algorithm for the solution of problem (EXI) is developed and computational results are presented. The algorithm obtained is an efficient algorithm to solve discrete nonlinear and nonseparable knapsack problems.
- Heuristic algorithms for the general nonlinear separable knapsack problem
- A nonlinear knapsack problem
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- A hybrid method for solving nonlinear knapsack problems
- The nonlinear knapsack problem - algorithms and applications
- A polynomially bounded algorithm for a singly constrained quadratic program
- An O(n) algorithm for quadratic knapsack problems
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Solving certain singly constrained convex optimization problems in production planning
- Efficient solution approaches for a discrete multi-facility competitive interaction model
- A hybrid method for solving nonlinear knapsack problems
- The nonlinear knapsack problem - algorithms and applications
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- Maximizing expected utility over a knapsack constraint
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- Maximizing a class of submodular utility functions with constraints
- Maximizing a class of submodular utility functions
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- Heuristic algorithms for the general nonlinear separable knapsack problem
- The newsvendor problem with capacitated suppliers and quantity discounts
- Competitive facility location model with concave demand
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
This page was built for publication: On a discrete nonlinear and nonseparable knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920849)
