The constrained compartmentalised knapsack problem

DOI10.1016/J.COR.2005.08.011zbMATH Open1112.90073OpenAlexW1983581592MaRDI QIDQ868151FDOQ868151

Fabiano do Prado Marques, Marcos N. 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

Recommendations

• The constrained compartmentalized knapsack problem: mathematical models and solution methods
• The knapsack problem with a minimum filling constraint
• The knapsack problem with neighbour constraints
• The knapsack problem with disjoint multiple-choice constraints
• The knapsack problem with special neighbor constraints
• On the solution of concave knapsack problems
• scientific article; zbMATH DE number 4005976
• On a cardinality constrained linear programming knapsack problem

zbMATH Keywords

knapsack problemscutting and packing problemsinteger and combinatorial optimisation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• Title not available (Why is that?)
• Cutting and packing. Special issue
• An improved typology of cutting and packing problems
• Title not available (Why is that?)
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• Two-dimensional packing problems: a survey
• A typology of cutting and packing problems
• Packing problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Title not available (Why is that?)
• The trim-loss and assortment problems: A survey
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• A Minimal Algorithm for the Bounded Knapsack Problem
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
• Modeling multistage cutting stock problems
• An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
• Polynomial time approximation schemes for class-constrained packing problems
• A two-phase roll cutting problem
• Reel and sheet cutting at a paper mill
• The one dimensional Compartmentalised Knapsack problem: a case study
• A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
• The cutting stock problem in a hardboard industry: A case study.
• Title not available (Why is that?)
• Bounds for nested knapsack problems

Cited In (13)

• A heuristic for the problem of one-dimensional steel coil cutting
• The inverse-parametric knapsack problem
• Approximation schemes for knapsack problems with shelf divisions
• Algorithms for the one-dimensional two-stage cutting stock problem
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• A one-dimensional bin packing problem with shelf divisions
• The constrained compartmentalized knapsack problem: mathematical models and solution methods
• On solving the double loading problem using a modified particle swarm optimization
• A strong integer linear optimization model to the compartmentalized knapsack problem
• An integer linear optimization model to the compartmentalized knapsack problem
• The knapsack problem with a minimum filling constraint
• A note on dual approximation algorithms for class constrained bin packing problems
• A Knapsack Secretary Problem with Applications

Uses Software

• Knapsack

This page was built for publication: The constrained compartmentalised knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868151)