Pages that link to "Item:Q542002"
From MaRDI portal
The following pages link to Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002):
Displaying 20 items.
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← 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)
- 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)
- A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem (Q2003457) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems'' (Q2184176) (← links)
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- Minimum cost delivery of multi-item orders in e-commerce logistics (Q2669718) (← links)
- A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem (Q2798113) (← links)
- CORAL: an exact algorithm for the multidimensional knapsack problem (Q2815454) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems (Q5202507) (← links)
