scientific article; zbMATH DE number 6836465

MaRDI QIDQ3134089zbMATH OpenFDO

Authors Yong-Jin Liu, Yanan Wen

Publication date 8 February 2018

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol13/p301.html

zbMATH Keywords

linear time complexity\(\ell_1\) regularizationcontinuous quadratic knapsack problemmedian search method

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• On linear-time algorithms for the continuous quadratic Knapsack problem
• On the continuous quadratic knapsack problem
• Linear programming for the \(0-1\) quadratic knapsack problem
• 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
• A linear-time algorithm for solving continuous maximin knapsack problems
• A two-phase method for solving continuous rank-one quadratic knapsack problems
• A library for continuous convex separable quadratic knapsack problems
• A Newton's method for the continuous quadratic knapsack problem
• An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
• A conic approximation method for the 0-1 quadratic knapsack problem

Cited in

(3)

• On linear-time algorithms for the continuous quadratic Knapsack problem
• Variable fixing algorithms for the continuous quadratic Knapsack problem
• A two-phase method for solving continuous rank-one quadratic knapsack problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134089)