A new variable reduction technique for convex integer quadratic programs (Q2472944): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apm.2006.11.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068464776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the optimal cutting of equal rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregate line capacity design for PWB assembly systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly Generated Test Problems for Positive Definite Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate dynamic programming approach to convex quadratic knapsack problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:55, 27 June 2024

scientific article
Language Label Description Also known as
English
A new variable reduction technique for convex integer quadratic programs
scientific article

    Statements

    A new variable reduction technique for convex integer quadratic programs (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    integer quadratic programming
    0 references
    variable reduction
    0 references
    convex quadratic programming
    0 references
    quadratic knapsack problem
    0 references
    0 references