Pages that link to "Item:Q1761939"
From MaRDI portal
The following pages link to Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939):
Displaying 17 items.
- A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem (Q3750525) (← links)
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems (Q5202507) (← links)
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)
- Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem (Q6629013) (← links)
