Pages that link to "Item:Q1755228"
From MaRDI portal
The following pages link to Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228):
Displaying 21 items.
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case (Q1595283) (← links)
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem (Q1730435) (← links)
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP (Q1761144) (← links)
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints (Q1781556) (← links)
- Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
- A logarithmic descent direction algorithm for the quadratic knapsack problem (Q2287590) (← links)
- Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
- (Q4350063) (← links)
- (Q5195390) (← links)
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners (Q6094505) (← links)
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)
- Exponential extrapolation memory for tabu search (Q6114931) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
- A knowledge-based iterated local search for the weighted total domination problem (Q6500414) (← links)
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets (Q6667807) (← links)