The multiple multidimensional knapsack with family-split penalties
type: Item
instance of: scholarly article
title: The multiple multidimensional knapsack with family-split penalties
zbMATH Open document ID: 1487.90562
author: S. Mancini
author: Michele Ciavotta
author: C. Meloni
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7354510
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: knapsack problems
zbMATH Keywords: integer programming
zbMATH Keywords: Benders' cuts
zbMATH Keywords: resource assignment
describes a project that uses: MULKNAP
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.07.052
OpenAlex ID: W2966328247
cites work: All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
cites work: Combinatorial Benders cuts for assembly line balancing problems with setups
cites work: Combinatorial Benders Cuts for the Minimum Tollbooth Problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Q4380371
cites work: An optimization algorithm for a penalized knapsack problem
cites work: Q4952619
cites work: Packing Groups of Items into Multiple Knapsacks
cites work: A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem
cites work: A knapsack-type public key cryptosystem based on arithmetic in finite fields
cites work: A survey of network virtualization
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
cites work: Combinatorial Benders' Cuts for the Strip Packing Problem
cites work: New exact approaches and approximation results for the penalized knapsack problem
cites work: Mathematical models and decomposition methods for the multiple knapsack problem
cites work: Solving Multiple Knapsack Problems by Cutting Planes
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: Exact approaches for the knapsack problem with setups
cites work: Q4198056
cites work: Generalized Benders decomposition
cites work: Hard multidimensional multiple choice knapsack problems, an empirical study
cites work: Heuristic algorithms for the multiple-choice multidimensional knapsack problem
cites work: Logic-based Benders decomposition
cites work: Upper and lower bounding procedures for the multiple knapsack assignment problem
cites work: Q4821303
cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
cites work: The multiobjective multidimensional knapsack problem: a survey and a new approach
cites work: Q3993418
cites work: Integer knapsack problems with set-up weights
cites work: Knapsack problems with setups
cites work: The 0-1 knapsack problem with multiple choice constraints
cites work: Improved dynamic programming and approximation results for the knapsack problem with setups
cites work: An exact algorithm for large multiple knapsack problems
cites work: Polynomial time approximation schemes for class-constrained packing problems
cites work: Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
cites work: A combinatorial Benders' decomposition for the lock scheduling problem
DOI: 10.1016/J.EJOR.2019.07.052
description: scientific article; zbMATH DE number 7354510