A branch-and-bound algorithm for hard multiple knapsack problems (Q545544): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-009-0660-y / rank
Normal rank
 
Property / cites work
 
Property / cites work: A PTAS for the multiple subset sum problem with different knapsack capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/4-approximation algorithm for multiple subset sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pruning Moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dominance procedure for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for 0-1 multiple-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Solution of 0-1 Loading Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and algorithms for the maximum cardinality bin packing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound and bound algorithm for the zero-one multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-009-0660-Y / rank
 
Normal rank

Latest revision as of 21:05, 9 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for hard multiple knapsack problems
scientific article

    Statements

    Identifiers