Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple Subset Sum Problem / 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: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for the Strip Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Meet-in-the-Middle Principle for Cutting and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic based Benders' decomposition for orthogonal stock cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Linear Programming Approach to the Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multiple Knapsack Problems by Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic routine for solving large loading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for hard multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounding procedures for the multiple knapsack assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A binary multiple knapsack model for single machine scheduling with machine unavailability / 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 procedure-based heuristic for 0-1 multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the zero-one multiple knapsack 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: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems / 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: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the multiple knapsack problem: the self-sufficient marine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145427 / rank
 
Normal rank

Revision as of 19:12, 17 July 2024

scientific article
Language Label Description Also known as
English
Mathematical models and decomposition methods for the multiple knapsack problem
scientific article

    Statements

    Mathematical models and decomposition methods for the multiple knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2019
    0 references
    combinatorial optimization
    0 references
    multiple knapsack problem
    0 references
    exact algorithms
    0 references
    pseudo-polynomial formulations
    0 references
    decomposition methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers