The following pages link to MULKNAP (Q18572):
Displaying 32 items.
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Retail category management. Decision support systems for assortment, shelf space, inventory and price planning. (Q636045) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573) (← links)
- Model and algorithms for multi-period sea cargo mix problem (Q872163) (← links)
- A multi-level genetic algorithm for a multi-stage space allocation problem (Q984123) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
- Tug scheduling for hinterland barge transport: a branch-and-price approach (Q1681331) (← links)
- An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
- An application of the multiple knapsack problem: the self-sufficient marine (Q1752270) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Cost based filtering for the constrained knapsack problem (Q1854754) (← links)
- Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A new upper bound for the multiple knapsack problem (Q2668625) (← links)
- An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555) (← links)
- Economic lot scheduling with resources in parallel (Q2997891) (← links)
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem (Q4678202) (← links)
- Linear Time Algorithms for Knapsack Problems with Bounded Weights (Q4939603) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
