A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
From MaRDI portal
Recommendations
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
- A cut-and-branch algorithm for the quadratic knapsack problem
- A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
- New algorithm for quadratic integer knapsack problems
- Algorithms for the solution of quadratic knapsack problems
- An O(n) algorithm for quadratic knapsack problems
- scientific article; zbMATH DE number 710573
- Integer quadratic knapsack problems
Cited in
(38)- The nonlinear knapsack problem - algorithms and applications
- Capacity-constrained multiple-market price discrimination
- A nonlinear knapsack problem
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- Decision model and analysis for investment interest expense deduction and allocation
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- On linear-time algorithms for the continuous quadratic Knapsack problem
- A relaxed projection method for general integer quadratic knapsack problem.
- An approximate dynamic programming approach to convex quadratic knapsack problems
- A penalty algorithm for solving convex separable knapsack problems
- A cut-and-branch algorithm for the quadratic knapsack problem
- A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- New algorithm for quadratic integer knapsack problems
- Integer quadratic knapsack problems
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
- Improving an exact approach for solving separable integer quadratic knapsack problems
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- A Projection Method for the Integer Quadratic Knapsack Problem
- A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
- A direct algorithm of separable quadratic knapsack problem
- A simple procedure for solving a continuous quadratic mathematical model.
- A Lagrangian relaxation approach to the edge-weighted clique problem
- A pegging algorithm for the nonlinear resource allocation problem
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- A combinatorial algorithm for inverse continuous quadratic knapsack problem
- Integer quadratic optimization
- The quadratic knapsack problem -- a survey
- A Newton's method for the continuous quadratic knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- A unified method for a class of convex separable nonlinear knapsack problems
This page was built for publication: A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835455)
