Simple solution methods for separable mixed linear and quadratic knapsack problem
From MaRDI portal
Recommendations
- Fast algorithm for the quadratic knapsack problem
- scientific article; zbMATH DE number 6263683
- A direct algorithm of separable quadratic knapsack problem
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1057696 (Why is no real title available?)
- scientific article; zbMATH DE number 1383441 (Why is no real title available?)
- scientific article; zbMATH DE number 2124285 (Why is no real title available?)
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A block active set algorithm for large-scale quadratic programming with box constraints
- A computational study on the quadratic knapsack problem with multiple constraints
- A hybrid support vector machines and logistic regression approach for forecasting intermittent demand of spare parts
- A new variable reduction technique for convex integer quadratic programs
- A nonlinear knapsack problem
- A polynomially bounded algorithm for a singly constrained quadratic program
- A semidefinite programming approach to the quadratic knapsack problem
- A survey on the continuous nonlinear resource allocation problem
- A unified method for a class of convex separable nonlinear knapsack problems
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Algorithms for separable nonlinear resource allocation problems
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An approximate dynamic programming approach to convex quadratic knapsack problems
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Computational development of a lagrangian dual approach for quadratic networks
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
- Convex programming with single separable constraint and bounded variables
- Convex quadratic programming with one constraint and bounded variables
- Convex separable minimization subject to bounded variables
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Exact Solution of the Quadratic Knapsack Problem
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- FPTAS for mixed-integer polynomial optimization with a fixed number of variables
- Fixing Variables in Semidefinite Relaxations
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- New trends in exact algorithms for the \(0-1\) knapsack problem
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- On the Convergence of Successive Linear-Quadratic Programming Algorithms
- On the continuous quadratic knapsack problem
- Production and inventory management under multiple resource constraints
- Quadratic knapsack problems
- Quadratic resource allocation with generalized upper bounds
- Quasi-Newton Updates with Bounds
- Reducing the number of variables in integer quadratic programming problem
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- The Nonlinear Resource Allocation Problem
- The explicit linear quadratic regulator for constrained systems
- The nonlinear knapsack problem - algorithms and applications
- The quadratic knapsack problem -- a survey
- Towards strong duality in integer programming
Cited in
(5)- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- A library for continuous convex separable quadratic knapsack problems
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- Fast algorithm for the quadratic knapsack problem
- A direct algorithm of separable quadratic knapsack problem
This page was built for publication: Simple solution methods for separable mixed linear and quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693416)
