The constrained compartmentalized knapsack problem: mathematical models and solution methods
From MaRDI portal
Publication:421557
DOI10.1016/j.ejor.2011.02.016zbMath1237.90201OpenAlexW1973143140MaRDI QIDQ421557
Aline A. S. Leão, Robinson Hoto, Maristela Oliveira Santos, Marcos Nereu Arenales
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.02.016
Related Items (8)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Determining the \(K\)-best solutions of knapsack problems ⋮ One-dimensional stock cutting: optimization of usable leftovers in consecutive orders ⋮ A strong integer linear optimization model to the compartmentalized knapsack problem ⋮ An integer linear optimization model to the compartmentalized knapsack problem ⋮ On solving the double loading problem using a modified particle swarm optimization ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ Algorithms for the one-dimensional two-stage cutting stock problem
Uses Software
Cites Work
- Tight bounds for online class-constrained packing
- Approximation schemes for knapsack problems with shelf divisions
- The constrained compartmentalised knapsack problem
- An LP-based approach to a two-stage cutting stock problem
- Polynomial time approximation schemes for class-constrained packing problems
- Row and column generation technique for a multistage cutting stock problem
- A two-phase roll cutting problem
- Modeling multistage cutting stock problems
- Reel and sheet cutting at a paper mill
- The class constrained bin packing problem with applications to video-on-demand
- A one-dimensional bin packing problem with shelf divisions
- An improved typology of cutting and packing problems
- The one dimensional Compartmentalised Knapsack problem: a case study
- Core Problems in Knapsack Algorithms
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems
- A note on dual approximation algorithms for class constrained bin packing problems
- A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- On two class-constrained versions of the multiple knapsack problem
- Benchmarking optimization software with performance profiles.
This page was built for publication: The constrained compartmentalized knapsack problem: mathematical models and solution methods
