On the product knapsack problem (Q1653266): 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.1007/s11590-017-1227-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2782280106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The paradox of multiple elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case / 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 Short Introduction to Computational Social Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the general nonlinear separable knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactions in Multiagent Systems: Fairness, Social Optimality and Individual Rationality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank

Latest revision as of 06:44, 16 July 2024

scientific article
Language Label Description Also known as
English
On the product knapsack problem
scientific article

    Statements

    On the product knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    knapsack problem
    0 references
    dynamic programming
    0 references
    complexity
    0 references
    mixed integer (non)linear programming
    0 references
    0 references
    0 references
    0 references
    0 references