A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MULKNAP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / 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.1287/ijoc.2022.1223 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4292737938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths / 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: Mathematical models and decomposition methods for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the multiple knapsack problem with divisible item sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the multiple knapsack problem / 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: A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location 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: A heuristic routine for solving large loading 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: Upper and lower bounding procedures for the multiple knapsack assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the capacitated facility location problem / 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: A procedure-based heuristic for 0-1 multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc flow formulations based on dynamic programming: theoretical foundations and applications / 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: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / 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: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP models for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Extra Dual Cuts to Accelerate Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 06:39, 31 July 2024

scientific article; zbMATH DE number 7640785
Language Label Description Also known as
English
A Branch-and-Price Algorithm for the Multiple Knapsack Problem
scientific article; zbMATH DE number 7640785

    Statements

    A Branch-and-Price Algorithm for the Multiple Knapsack Problem (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2023
    0 references
    multiple knapsack problem
    0 references
    branch-and-price
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers