Pages that link to "Item:Q3780001"
From MaRDI portal
The following pages link to Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach (Q3780001):
Displaying 13 items.
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
- Decentralization of responsibility for site decontamination projects: A budget allocation approach (Q1390197) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem (Q1616250) (← links)
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems (Q3114774) (← links)
- The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance (Q3116733) (← links)
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems (Q3325470) (← links)
- Asignacion de recuerdos max-min: Propiedades y algoritmos (Q3354440) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack (Q6568952) (← links)