A solution method for a knapsack problem and its variant (Q3028724): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimal Inequalities and Subadditive Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3843706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Group Theoretic Algorithm for Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a group theoretic integer programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Solving Integer Programming Problems by Aggregating Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: When the Greedy Solution Solves a Class of Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of optimal solutions to integer and mixed-integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal-Path Algorithm for the "Money Changing Problem" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm / rank
 
Normal rank

Revision as of 11:16, 18 June 2024

scientific article
Language Label Description Also known as
English
A solution method for a knapsack problem and its variant
scientific article

    Statements

    A solution method for a knapsack problem and its variant (English)
    0 references
    0 references
    1986
    0 references
    knapsack problem
    0 references
    single equality constraint
    0 references
    Dijkstra's shortest path algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references