An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930): 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.1016/j.cor.2004.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992916292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and search algorithm for a class of nonlinear knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and valid inequalities of the node capacitated graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic 0-1 knapsack problem with series-parallel support / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for fractional knapsack problems / 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: A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear knapsack problem - algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank

Latest revision as of 17:01, 10 June 2024

scientific article
Language Label Description Also known as
English
An approximate dynamic programming approach to convex quadratic knapsack problems
scientific article

    Statements

    An approximate dynamic programming approach to convex quadratic knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate dynamic programming
    0 references
    quadratic knapsack problem
    0 references
    heuristics
    0 references
    0 references