Variable fixing method by weighted average for the continuous quadratic knapsack problem
From MaRDI portal
Publication:2074624
DOI10.3934/naco.2021048zbMath1478.65062OpenAlexW3211658397MaRDI QIDQ2074624
Publication date: 10 February 2022
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2021048
Uses Software
Cites Work
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Linear time algorithms for some separable quadratic programming problems
- An O(n) algorithm for quadratic knapsack problems
- Algorithms for the solution of quadratic knapsack problems
- A Newton's method for the continuous quadratic knapsack problem
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- On the continuous quadratic knapsack problem
- Quadratic resource allocation with generalized upper bounds
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- Support-vector networks
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- A library for continuous convex separable quadratic knapsack problems
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- Minimum variance allocation among constrained intervals
- 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
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Continuous quadratic programming formulations of optimization problems on graphs
- A Parallel Projection for the Multicommodity Network Model
- A lagrangean relaxation algorithm for the constrained matrix problem
- Convex quadratic programming with one constraint and bounded variables
- Quasi-Newton Updates with Bounds
- A polynomially bounded algorithm for a singly constrained quadratic program
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Computational development of a lagrangian dual approach for quadratic networks
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Graph Partitioning and Continuous Quadratic Programming
- Validation of subgradient optimization
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Projection Method for the Integer Quadratic Knapsack Problem
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
- Algorithm 813
- On Quadratic Programming
This page was built for publication: Variable fixing method by weighted average for the continuous quadratic knapsack problem
