Mathematical models and decomposition methods for the multiple knapsack problem
From MaRDI portal
Recommendations
- Solving Multiple Knapsack Problems by Cutting Planes
- An exact algorithm for large multiple knapsack problems
- scientific article; zbMATH DE number 3906236
- Upper and lower bounding procedures for the multiple knapsack assignment problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3573595 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1445306 (Why is no real title available?)
- A 3/4-approximation algorithm for multiple subset sum
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Linear Programming Approach to the Cutting Stock Problem
- A PTAS for the multiple subset sum problem with different knapsack capacities
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- A bound and bound algorithm for the zero-one multiple knapsack problem
- A branch-and-bound algorithm for hard multiple knapsack problems
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- A heuristic routine for solving large loading problems
- A procedure-based heuristic for 0-1 multiple knapsack problems
- A typology of cutting and packing problems
- An Algorithm for Large Zero-One Knapsack Problems
- An Algorithm for the Solution of 0-1 Loading Problems
- An algorithm for 0-1 multiple-knapsack problems
- An application of the multiple knapsack problem: the self-sufficient marine
- An exact algorithm for large multiple knapsack problems
- An improved typology of cutting and packing problems
- Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Combinatorial Benders' cuts for the strip packing problem
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Heuristic algorithms for the multiple knapsack problem
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Principles and Practice of Constraint Programming – CP 2004
- Reducibility among combinatorial problems
- Solution of the zero-one multiple knapsack problem
- Solving Multiple Knapsack Problems by Cutting Planes
- The Loading Problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- The multiple subset sum problem
- Upper and lower bounding procedures for the multiple knapsack assignment problem
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(25)- Faster algorithms for \(k\)-subset sum and variations
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
- A novel discrete differential evolution algorithm combining transfer function with modulo operation for solving the multiple knapsack problem
- A multi-period renewal equipment problem
- The multiple multidimensional knapsack with family-split penalties
- Optimal selection of touristic packages based on user preferences during sports mega-events
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- A decomposition approach for multidimensional knapsacks with family‐split penalties
- Half-cycle: a new formulation for modelling kidney exchange problems
- A combinatorial flow-based formulation for temporal bin packing problems
- A new upper bound for the multiple knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation
- Extending the reflect flow formulation to variable-sized one-dimensional cutting and skiving stock problems
- Multi-constrained matroidal knapsack problems
- The assignment and loading transportation problem
- Faster algorithms for \(k\)-\textsc{Subset Sum} and variations
- One-dimensional stock cutting resilient against singular random defects
- A branch-and-price algorithm for the temporal bin packing problem
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
This page was built for publication: Mathematical models and decomposition methods for the multiple knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755383)
