The constrained compartmentalised knapsack problem

DOI10.1016/J.COR.2005.08.011MaRDI QIDQ868151zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

knapsack problemscutting and packing problemsinteger and combinatorial optimisation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

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

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 719668 (Why is no real title available?)
• scientific article; zbMATH DE number 1175962 (Why is no real title available?)
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack 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 Linear Programming Approach to the Cutting-Stock Problem
• A Minimal Algorithm for the Bounded Knapsack Problem
• A two-phase roll cutting problem
• A typology of cutting and packing problems
• An algorithm for determining the \(k\)-best solutions of the one-dimensional knapsack problem
• An improved typology of cutting and packing problems
• Bounds for nested knapsack problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Cutting and packing. Special issue
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Modeling multistage cutting stock problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• Packing problems
• Polynomial time approximation schemes for class-constrained packing problems
• Reel and sheet cutting at a paper mill
• The cutting stock problem in a hardboard industry: A case study.
• The one dimensional Compartmentalised Knapsack problem: a case study
• The trim-loss and assortment problems: A survey
• Two-dimensional packing problems: a survey

Cited in

(15)

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

Describes a project that uses

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)