MULKNAP

swMATH6467MaRDI QIDQ18572FDOQ18572

Author name not available (Why is that?)

Described by source

• An exact algorithm for large multiple knapsack problems

Cited In (38)

• Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
• A multi-period network design problem for cellular telecommunication systems
• Cost based filtering for the constrained knapsack problem
• Title not available (Why is that?)
• LP based heuristics for the multiple knapsack problem with assignment restrictions
• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
• Semi-definite relaxation algorithm of multiple knapsack problem
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
• A multi-level genetic algorithm for a multi-stage space allocation problem
• Orbital shrinking: theory and applications
• An application of the multiple knapsack problem: the self-sufficient marine
• Mathematical models and decomposition methods for the multiple knapsack problem
• Title not available (Why is that?)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem
• The multiple multidimensional knapsack with family-split penalties
• An exact algorithm for the fixed-charge multiple knapsack problem
• A successive approximation algorithm for the multiple knapsack problem
• Title not available (Why is that?)
• An improved typology of cutting and packing problems
• An exact algorithm for the budget-constrained multiple knapsack problem
• A new upper bound for the multiple knapsack problem
• Model and algorithms for multi-period sea cargo mix problem
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• 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
• Stochastic binary problems with simple penalties for capacity constraints violations
• Retail category management. Decision support systems for assortment, shelf space, inventory and price planning.
• Tug scheduling for hinterland barge transport: a branch-and-price approach
• A branch-and-bound algorithm for hard multiple knapsack problems
• Economic lot scheduling with resources in parallel
• A survey of effective heuristics and their application to a variety of knapsack problems
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
• Iterated responsive threshold search for the quadratic multiple knapsack problem
• An effective hybrid approach to the two-stage capacitated facility location problem
• Upper and lower bounding procedures for the multiple knapsack assignment problem
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating

This page was built for software: MULKNAP