Mathematical models and decomposition methods for the multiple knapsack problem
type: Item
instance of: scholarly article
title: Mathematical models and decomposition methods for the multiple knapsack problem
zbMATH Open document ID: 1430.90480
author: Mauro Dell'Amico
author: Maxence Delorme
author: Manuel Iori
author: Silvano Martello
published in: European Journal of Operational Research
publication date: 2019-01-09T00:00:00Z
full work available at URL: http://hdl.handle.net/11585/683147
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6999087
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: multiple knapsack problem
zbMATH Keywords: exact algorithms
zbMATH Keywords: pseudo-polynomial formulations
zbMATH Keywords: decomposition methods
describes a project that uses: MULKNAP
describes a project that uses: Knapsack
MaRDI profile type: Publication
OpenAlex ID: W2898872836
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Bin packing and related problems: general arc-flow formulation with graph compression
cites work: The multiple subset sum problem
cites work: A PTAS for the multiple subset sum problem with different knapsack capacities
cites work: A 3/4-approximation algorithm for multiple subset sum
cites work: Q4952619
cites work: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
cites work: Combinatorial Benders' Cuts for the Strip Packing Problem
cites work: The Meet-in-the-Middle Principle for Cutting and Packing Problems
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: Logic based Benders' decomposition for orthogonal stock cutting problems
cites work: A New Linear Programming Approach to the Cutting Stock Problem
cites work: A typology of cutting and packing problems
cites work: The Loading Problem
cites work: Solving Multiple Knapsack Problems by Cutting Planes
cites work: A heuristic routine for solving large loading problems
cites work: A branch-and-bound algorithm for hard multiple knapsack problems
cites work: Q3624058
cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: An algorithm for 0-1 multiple-knapsack problems
cites work: An Algorithm for the Solution of 0-1 Loading Problems
cites work: Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
cites work: Reducibility among Combinatorial Problems
cites work: Upper and lower bounding procedures for the multiple knapsack assignment problem
cites work: Q4821303
cites work: A binary multiple knapsack model for single machine scheduling with machine unavailability
cites work: Upper bounds and algorithms for the maximum cardinality bin packing problem.
cites work: A procedure-based heuristic for 0-1 multiple knapsack problems
cites work: Solution of the zero-one multiple knapsack problem
cites work: A bound and bound algorithm for the zero-one multiple knapsack problem
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: Q3993418
cites work: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
cites work: An exact algorithm for large multiple knapsack problems
cites work: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: An application of the multiple knapsack problem: the self-sufficient marine
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: An improved typology of cutting and packing problems
cites work: Q4145427
DOI: 10.1016/J.EJOR.2018.10.043
description: scientific article; zbMATH DE number 6999087