An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2828635 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2373537127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic resource allocation with generalized upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Projection Method for the Integer Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Updates with Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Gradients and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton's method for the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for maximizing a function over a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous quadratic programming formulations of optimization problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multilevel bilinear programming algorithm for the vertex separator problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Continuous Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Active Set Algorithm for Box Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially bounded algorithm for a singly constrained quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: About strongly polynomial time algorithms for quadratic optimization over submodular constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable fixing algorithms for the continuous quadratic Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Projection for the Multicommodity Network Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational development of a lagrangian dual approach for quadratic networks / rank
 
Normal rank

Latest revision as of 01:22, 14 July 2024

scientific article; zbMATH DE number 6738143
Language Label Description Also known as
English
An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
scientific article; zbMATH DE number 6738143

    Statements

    An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2017
    0 references
    continuous quadratic knapsack
    0 references
    convex programming
    0 references
    heap
    0 references
    nonlinear programming
    0 references
    quadratic programming
    0 references
    separable programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references