Algorithms for the solution of quadratic knapsack problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3677572 (Why is no real title available?)
- scientific article; zbMATH DE number 3561096 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4193461 (Why is no real title available?)
- A Centered Projective Algorithm for Linear Programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An O(n) algorithm for quadratic knapsack problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An algorithm for nonconvex programming problems
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Checking local optimality in constrained quadratic programming is NP- hard
- Computing a Trust Region Step
- Constrained global optimization: algorithms and applications
- Convex quadratic programming with one constraint and bounded variables
- Duality in quadratic programming
- Interior path following primal-dual algorithms. I: Linear programming
- Local minima for indefinite quadratic knapsack problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Methods for Global Concave Minimization: A Bibliographic Survey
- Newton’s Method with a Model Trust Region Modification
- Optimal scaling of balls and polyhedra
- Quadratic problems defined on a convex hull of points
- Quasi-Newton Updates with Bounds
Cited in
(36)- A logarithmic descent direction algorithm for the quadratic knapsack problem
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs
- An O(n) algorithm for quadratic knapsack problems
- Computation of sparse and dense equilibrium strategies of evolutionary games
- Comparative analysis of the cutting angle and simulated annealing methods in global optimization
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- Inverse optimization for linearly constrained convex separable programming problems
- Approximation algorithms for indefinite quadratic programming
- A pegging algorithm for the nonlinear resource allocation problem
- New infeasible interior-point algorithm based on monomial method
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- Quadratic bottleneck knapsack problems
- Equilibrium distributions of populations of biological species on networks of social sites
- A note on optimal solutions to quadratic knapsack problems
- The quadratic knapsack problem -- a survey
- A survey on the continuous nonlinear resource allocation problem
- Local minima for indefinite quadratic knapsack problems
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- Optimality and stability of symmetric evolutionary games with applications in genetic selection
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- Minimum variance allocation among constrained intervals
- Global optimality conditions and optimization methods for quadratic knapsack problems
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- Minimum norm solution to the positive semidefinite linear complementarity problem
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem
- Quadratic resource allocation with generalized upper bounds
- scientific article; zbMATH DE number 2124285 (Why is no real title available?)
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
- A branch and bound algorithm for constrained least squares
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- Competitive facility location model with concave demand
- The nonlinear knapsack problem - algorithms and applications
This page was built for publication: Algorithms for the solution of quadratic knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806968)
