Pages that link to "Item:Q3688105"
From MaRDI portal
The following pages link to Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105):
Displaying 17 items.
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Addressing capacity uncertainty in resource-constrained assignment problems (Q2566939) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)
- Intelligent water drops algorithm (Q3526263) (← links)
- Modeling multiple plant sourcing decisions (Q3532786) (← links)
- Piecewise convex maximization approach to multiknapsack (Q3646095) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben (Q3804451) (← links)
- Surrogate Constraints in Integer Programming (Q3976935) (← links)
- An improved enumeration for pure 0-1 programs (Q3978584) (← links)
- Heuristics for the multi-resource generalized assignment problem (Q4544217) (← links)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- An efficient algorithm to allocate shelf space (Q5937352) (← links)
- Using fuzzy numbers in knapsack problems (Q5954834) (← links)
