Pages that link to "Item:Q1327230"
From MaRDI portal
The following pages link to An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230):
Displaying 26 items.
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
- A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem (Q989843) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← 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)
- Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- An ant colony optimization approach for the multidimensional knapsack problem (Q2267820) (← links)
- Dynamic tabu list management using the reverse elimination method (Q2366993) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem (Q2427438) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← 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)
- Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? (Q3304189) (← links)
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)
- Heuristics for the multi-resource generalized assignment problem (Q4544217) (← links)
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)
