Testing integer knapsacks for feasibility (Q1266633): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q293110
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jennifer K. Ryan / 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/0377-2217(94)00214-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076444930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming over a Finite Additive Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic integer algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of an integral monoid and integer programming feasibility / 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

Latest revision as of 15:36, 28 May 2024

scientific article
Language Label Description Also known as
English
Testing integer knapsacks for feasibility
scientific article

    Statements

    Identifiers