Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/j.ejor.2014.02.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094913290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the multiple knapsack problem with assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procedure-based heuristic for 0-1 multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment problems: a golden anniversary survey / 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: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the fixed-charge multiple knapsack problem / rank
 
Normal rank

Latest revision as of 16:15, 9 July 2024

scientific article
Language Label Description Also known as
English
Upper and lower bounding procedures for the multiple knapsack assignment problem
scientific article

    Statements

    Upper and lower bounding procedures for the multiple knapsack assignment problem (English)
    0 references
    0 references
    0 references
    4 February 2015
    0 references
    combinatorial optimization
    0 references
    heuristics
    0 references
    multiple knapsack problem
    0 references
    assignment problem
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references
    0 references

    Identifiers