A branch and bound algorithm for the generalized assignment problem (Q4066849): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710339121855
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An all Zero-One Algorithm for a Certain Class of Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Implicit Enumeration Approach for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch Search Algorithm for the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction Algorithm for Zero-One Single Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems / rank
 
Normal rank

Latest revision as of 16:02, 12 June 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the generalized assignment problem
scientific article

    Statements

    Identifiers