An exact algorithm for large multiple knapsack problems
From MaRDI portal
Publication:1124710
DOI10.1016/S0377-2217(98)00120-9zbMath0948.90110OpenAlexW2050997304WikidataQ58826495 ScholiaQ58826495MaRDI QIDQ1124710
Publication date: 27 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00120-9
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39)
Related Items (37)
An exact algorithm for the budget-constrained multiple knapsack problem ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ An improved typology of cutting and packing problems ⋮ Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables ⋮ LP based heuristics for the multiple knapsack problem with assignment restrictions ⋮ Model and algorithms for multi-period sea cargo mix problem ⋮ A new upper bound for the multiple knapsack problem ⋮ Tug scheduling for hinterland barge transport: a branch-and-price approach ⋮ Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights ⋮ Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ Stochastic binary problems with simple penalties for capacity constraints violations ⋮ An effective hybrid approach to the two-stage capacitated facility location problem ⋮ Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ An application of the multiple knapsack problem: the self-sufficient marine ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Discrete location problems with push-pull objectives ⋮ Semi-definite relaxation algorithm of multiple knapsack problem ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem ⋮ A multi-period network design problem for cellular telecommunication systems ⋮ Upper bounds and exact algorithms for \(p\)-dispersion problems ⋮ A multi-level genetic algorithm for a multi-stage space allocation problem ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ Orbital shrinking: theory and applications ⋮ Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem ⋮ Solving wind farm layout optimization with mixed integer programs and constraint programs ⋮ Upper and lower bounding procedures for the multiple knapsack assignment problem ⋮ PARTITIONING TREES OF SUPPLY AND DEMAND ⋮ An exact algorithm for the fixed-charge multiple knapsack problem ⋮ MULKNAP ⋮ A successive approximation algorithm for the multiple knapsack problem ⋮ Iterated responsive threshold search for the quadratic multiple knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of the zero-one multiple knapsack problem
- A bound and bound algorithm for the zero-one multiple knapsack problem
- An Algorithm for Large Zero-One Knapsack Problems
- Computing Partitions with Applications to the Knapsack Problem
- An algorithm for 0-1 multiple-knapsack problems
- The One Dimensional Cutting Stock Problem Using Two Objectives
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Discrete-Variable Extremum Problems
This page was built for publication: An exact algorithm for large multiple knapsack problems