A decomposition approach for multidimensional knapsacks with family‐split penalties

Related Items (1)

Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
Hard multidimensional multiple choice knapsack problems, an empirical study
An exact algorithm for the fixed-charge multiple knapsack problem
Knapsack problems with setups
An exact algorithm for large multiple knapsack problems
Partitioning procedures for solving mixed-variables programming problems
The 0-1 knapsack problem with multiple choice constraints
Polynomial time approximation schemes for class-constrained packing problems
Logic-based Benders decomposition
The multidimensional 0-1 knapsack problem: an overview.
New exact approaches and approximation results for the penalized knapsack problem
An exact approach for the 0-1 knapsack problem with setups
Exact approaches for the knapsack problem with setups
Mathematical models and decomposition methods for the multiple knapsack problem
The multiple multidimensional knapsack with family-split penalties
Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
An optimization algorithm for a penalized knapsack problem
Upper and lower bounding procedures for the multiple knapsack assignment problem
Integer knapsack problems with set-up weights
The multi-period multi-trip container drayage problem with release and due dates
The multiobjective multidimensional knapsack problem: a survey and a new approach
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Packing Groups of Items into Multiple Knapsacks
Improved dynamic programming and approximation results for the knapsack problem with setups
Heuristic algorithms for the multiple-choice multidimensional knapsack problem
Solving Multiple Knapsack Problems by Cutting Planes
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Use of Ranks in One-Criterion Variance Analysis

This page was built for publication: A decomposition approach for multidimensional knapsacks with family‐split penalties