The one dimensional Compartmentalised Knapsack problem: a case study

DOI10.1016/J.EJOR.2005.07.030MaRDI QIDQ2643951zbMATH OpenOpenAlexFDO

Authors Robinson Hoto, Marcos N. Arenales, Nelson Maculan

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)

Recommendations

• A heuristic for the problem of one-dimensional steel coil cutting
• The constrained compartmentalised knapsack problem
• scientific article; zbMATH DE number 4055375
• The constrained compartmentalized knapsack problem: mathematical models and solution methods
• The problem of the compartmentalized knapsack: a proposal of three new heuristics

Cites work

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

Cited in

(12)

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

Describes a project that uses

Uses Software

• Knapsack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643951)