The one dimensional Compartmentalised Knapsack problem: a case study

DOI10.1016/j.ejor.2005.07.030zbMath1138.90457OpenAlexW2007198263MaRDI QIDQ2643951

Marcos Nereu Arenales, Nelson F. Maculan, Robinson Hoto

Publication date: 27 August 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.07.030

zbMATH Keywords

cutting and packing problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (10)

Approximation schemes for knapsack problems with shelf divisions ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ The constrained compartmentalised knapsack problem ⋮ A strong integer linear optimization model to the compartmentalized knapsack problem ⋮ An integer linear optimization model to the compartmentalized knapsack problem ⋮ The constrained compartmentalized knapsack problem: mathematical models and solution methods ⋮ On solving the double loading problem using a modified particle swarm optimization ⋮ A one-dimensional bin packing problem with shelf divisions ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ A note on dual approximation algorithms for class constrained bin packing problems

Uses Software

• Knapsack

Cites Work

• A new enumeration scheme for the knapsack problem
• An LP-based approach to a two-stage cutting stock problem
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
• Bounds for nested knapsack problems
• The trim-loss and assortment problems: A survey
• Polynomial time approximation schemes for class-constrained packing problems
• A minimal algorithm for the multiple-choice knapsack problem
• Row and column generation technique for a multistage cutting stock problem
• A two-phase roll cutting problem
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• A typology of cutting and packing problems
• Reel and sheet cutting at a paper mill
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• A Linear Programming Approach to the Cutting-Stock Problem
• An Algorithm for Two-Dimensional Cutting Problems
• A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• The Theory and Computation of Knapsack Functions
• Unnamed Item

This page was built for publication: The one dimensional Compartmentalised Knapsack problem: a case study