The constrained compartmentalised knapsack problem
From MaRDI portal
Publication:868151
DOI10.1016/j.cor.2005.08.011zbMath1112.90073OpenAlexW1983581592MaRDI QIDQ868151
Fabiano do Prado Marques, Marcos Nereu Arenales
Publication date: 19 February 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.08.011
Related Items (10)
Approximation schemes for knapsack problems with shelf divisions ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ 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 heuristic for the problem of one-dimensional steel coil cutting ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cutting and packing. Special issue
- Bounds for nested knapsack problems
- The trim-loss and assortment problems: A survey
- Packing problems
- Polynomial time approximation schemes for class-constrained packing problems
- The cutting stock problem in a hardboard industry: A case study.
- A two-phase roll cutting problem
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Modeling multistage cutting stock problems
- Reel and sheet cutting at a paper mill
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- An improved typology of cutting and packing problems
- The one dimensional Compartmentalised Knapsack problem: a case study
- A Linear Programming Approach to the Cutting-Stock Problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- A Minimal Algorithm for the Bounded Knapsack Problem
- A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
- An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
This page was built for publication: The constrained compartmentalised knapsack problem
