An integer linear optimization model to the compartmentalized knapsack problem

DOI10.1111/itor.12490OpenAlexW2771295089MaRDI QIDQ6088172

Nelson F. Maculan, Robinson Hoto, Unnamed Author

Publication date: 16 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12490

zbMATH Keywords

linear optimizationdiscrete optimizationcompartmentalized knapsack problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ The Parallel Quantum Algorithm for the Class of Optimization ⋮ A strong integer linear optimization model to the compartmentalized knapsack problem ⋮ A genetic algorithm for optimizing space utilization in aircraft hangar shop ⋮ A heuristic for the problem of one-dimensional steel coil cutting

Cites Work

• Unnamed Item
• The constrained compartmentalized knapsack problem: mathematical models and solution methods
• The constrained compartmentalised knapsack problem
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• Bounds for nested knapsack problems
• Row and column generation technique for a multistage cutting stock problem
• A two-phase roll cutting problem
• Reel and sheet cutting at a paper mill
• The one dimensional Compartmentalised Knapsack problem: a case study
• A Linear Programming Approach to the Cutting-Stock Problem
• L’algebre de Boole et ses applications en recherche operationnelle
• A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
• Discrete-Variable Extremum Problems