An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
From MaRDI portal
DOI10.1137/S0036144598330177zbMATH Open0958.65058OpenAlexW2082350762MaRDI QIDQ4509764FDOQ4509764
Authors:
Publication date: 19 October 2000
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036144598330177
Recommendations
- A Newton's method for the continuous quadratic knapsack problem
- A fast and robust method for computing real roots of nonlinear equations
- Finding roots of nonlinear equations using the method of concave support functions
- An efficient method based on progressive interpolation for solving non-linear equations
- Observations on a simple numeric problem
Numerical mathematical programming methods (65K05) Convex programming (90C25) Production models (90B30) Numerical computation of solutions to single equations (65H05)
Cited In (21)
- A convergent decomposition algorithm for support vector machines
- A linear-time algorithm for solving continuous maximin knapsack problems
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- A penalty algorithm for solving convex separable knapsack problems
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Title not available (Why is that?)
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- A Newton's method for the continuous quadratic knapsack problem
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- A unified method for a class of convex separable nonlinear knapsack problems
- Solving nested-constraint resource allocation problems with an interior point method
- A survey on the continuous nonlinear resource allocation problem
- Title not available (Why is that?)
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
- The continuous knapsack problem with capacities
- The submodular knapsack polytope
- Solving the continuous nonlinear resource allocation problem with an interior point method
- Maximum likelihood estimation of cell probabilities in constrained multinomial models
- On a nonseparable convex maximization problem with continuous Knapsack constraints
This page was built for publication: An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509764)
