MULKNAP

swMATH6467MaRDI QIDQ18572

No author found.

Described by source

• An exact algorithm for large multiple knapsack problems

Related Items (38)

Unnamed Item ⋮ 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 ⋮ Unnamed Item ⋮ Retail category management. Decision support systems for assortment, shelf space, inventory and price planning. ⋮ Stochastic binary problems with simple penalties for capacity constraints violations ⋮ A survey of effective heuristics and their application to a variety of knapsack problems ⋮ 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 ⋮ Economic lot scheduling with resources in parallel ⋮ An application of the multiple knapsack problem: the self-sufficient marine ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ 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 ⋮ Heuristic algorithms for the multiple-choice multidimensional knapsack problem ⋮ Linear Time Algorithms for Knapsack Problems with Bounded Weights ⋮ 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 ⋮ Upper and lower bounding procedures for the multiple knapsack assignment problem ⋮ An exact algorithm for the fixed-charge multiple knapsack problem ⋮ Unnamed Item ⋮ A successive approximation algorithm for the multiple knapsack problem ⋮ Iterated responsive threshold search for the quadratic multiple knapsack problem ⋮ Cost based filtering for the constrained knapsack problem

This page was built for software: MULKNAP