A strong integer linear optimization model to the compartmentalized knapsack problem

DOI10.1111/itor.12639OpenAlexW4247656865WikidataQ128382616 ScholiaQ128382616MaRDI QIDQ6088168

José M. Valério de Carvalho, 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.12639

zbMATH Keywords

linear programmingdiscrete optimizationcompartmentalized knapsack problemlinear strong model optimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A heuristic for the problem of one-dimensional steel coil cutting

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• An LP-based approach to a two-stage cutting stock problem
• A two-phase roll cutting problem
• The one dimensional Compartmentalised Knapsack problem: a case study
• A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
• An integer linear optimization model to the compartmentalized knapsack problem

This page was built for publication: A strong integer linear optimization model to the compartmentalized knapsack problem