An exact algorithm for large multiple knapsack problems

From MaRDI portal
Publication:1124710

DOI10.1016/S0377-2217(98)00120-9zbMath0948.90110OpenAlexW2050997304WikidataQ58826495 ScholiaQ58826495MaRDI QIDQ1124710

David Pisinger

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




Related Items (37)

An exact algorithm for the budget-constrained multiple knapsack problemA Branch-and-Price Algorithm for the Multiple Knapsack ProblemAn improved typology of cutting and packing problemsColumn generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problemHybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problemA binary multiple knapsack model for single machine scheduling with machine unavailabilityCorrelative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variablesLP based heuristics for the multiple knapsack problem with assignment restrictionsModel and algorithms for multi-period sea cargo mix problemA new upper bound for the multiple knapsack problemTug scheduling for hinterland barge transport: a branch-and-price approachReducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insightsEffective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problemA decomposition approach for multidimensional knapsacks with family‐split penaltiesStochastic binary problems with simple penalties for capacity constraints violationsAn effective hybrid approach to the two-stage capacitated facility location problemIntegrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack SolverAn Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event SeatingAn application of the multiple knapsack problem: the self-sufficient marineMathematical models and decomposition methods for the multiple knapsack problemDiscrete location problems with push-pull objectivesSemi-definite relaxation algorithm of multiple knapsack problemA branch-and-bound algorithm for hard multiple knapsack problemsVery large-scale neighborhood search for the \(K\)-constraint multiple knapsack problemA multi-period network design problem for cellular telecommunication systemsUpper bounds and exact algorithms for \(p\)-dispersion problemsA multi-level genetic algorithm for a multi-stage space allocation problemThe multiple multidimensional knapsack with family-split penaltiesOrbital shrinking: theory and applicationsSensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problemSolving wind farm layout optimization with mixed integer programs and constraint programsUpper and lower bounding procedures for the multiple knapsack assignment problemPARTITIONING TREES OF SUPPLY AND DEMANDAn exact algorithm for the fixed-charge multiple knapsack problemMULKNAPA successive approximation algorithm for the multiple knapsack problemIterated responsive threshold search for the quadratic multiple knapsack problem


Uses Software


Cites Work


This page was built for publication: An exact algorithm for large multiple knapsack problems