The constrained compartmentalised knapsack problem
type: Item
instance of: scholarly article
title: The constrained compartmentalised knapsack problem
zbMATH Open document ID: 1112.90073
author: Fabiano do Prado Marques
author: Marcos N. Arenales
published in: Computers \& Operations Research
publication date: 2007-02-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5128197
zbMATH Keywords: knapsack problems
zbMATH Keywords: cutting and packing problems
zbMATH Keywords: integer and combinatorial optimisation
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.cor.2005.08.011
OpenAlex ID: W1983581592
cites work: Q4198056
cites work: The trim-loss and assortment problems: A survey
cites work: A typology of cutting and packing problems
cites work: Q3993418
cites work: Packing problems
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study
cites work: Q4398379
cites work: Two-dimensional packing problems: a survey
cites work: Cutting and packing. Special issue
cites work: Q4321918
cites work: An improved typology of cutting and packing problems
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
cites work: A two-phase roll cutting problem
cites work: Reel and sheet cutting at a paper mill
cites work: Bounds for nested knapsack problems
cites work: Polynomial time approximation schemes for class-constrained packing problems
cites work: The one dimensional Compartmentalised Knapsack problem: a case study
cites work: Modeling multistage cutting stock problems
cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
cites work: The cutting stock problem in a hardboard industry: A case study.
cites work: A Minimal Algorithm for the Bounded Knapsack Problem
cites work: An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
DOI: 10.1016/J.COR.2005.08.011
Recommended article: The constrained compartmentalized knapsack problem: mathematical models and solution methods
Recommended article: The knapsack problem with a minimum filling constraint
Recommended article: The knapsack problem with neighbour constraints
Recommended article: The knapsack problem with disjoint multiple-choice constraints
Recommended article: The knapsack problem with special neighbor constraints
Recommended article: On the solution of concave knapsack problems
Recommended article: Q3757684
Recommended article: On a cardinality constrained linear programming knapsack problem
description: scientific article; zbMATH DE number 5128197