The multiple multidimensional knapsack with family-split penalties
From MaRDI portal
Publication:2029273
DOI10.1016/j.ejor.2019.07.052zbMath1487.90562OpenAlexW2966328247MaRDI QIDQ2029273
Carlo Meloni, Simona Mancini, Michele Ciavotta
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.07.052
Related Items (3)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Optimal selection of touristic packages based on user preferences during sports mega-events ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
- A combinatorial Benders' decomposition for the lock scheduling problem
- Hard multidimensional multiple choice knapsack problems, an empirical study
- A survey of network virtualization
- 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
- Exact approaches for the knapsack problem with setups
- Combinatorial Benders cuts for assembly line balancing problems with setups
- Mathematical models and decomposition methods for the multiple knapsack problem
- An optimization algorithm for a penalized knapsack problem
- Upper and lower bounding procedures for the multiple knapsack assignment problem
- Generalized Benders decomposition
- Integer knapsack problems with set-up weights
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Combinatorial Benders Cuts for the Minimum Tollbooth Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- 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
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
This page was built for publication: The multiple multidimensional knapsack with family-split penalties
