Pages that link to "Item:Q960412"
From MaRDI portal
The following pages link to Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412):
Displaying 25 items.
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) (← links)
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← 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)
- A randomized heuristic repair for the multidimensional knapsack problem (Q828650) (← links)
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
- Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- A genetic algorithm for the multidimensional knapsack problem (Q1273651) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- A procedure-based heuristic for 0-1 multiple knapsack problems (Q1758871) (← links)
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- Memory and Learning in Metaheuristics (Q2866122) (← links)
- The multidimensional knapsack problem: structure and algorithms (Q2899058) (← 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)