Pages that link to "Item:Q1609923"

The following pages link to An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923):

Displaying 43 items.

• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
• Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
• Solving a novel inventory location model with stochastic constraints and \((R,s,S)\) inventory control policy (Q473956) (← links)
• Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
• Parameter tuning for local-search-based matheuristic methods (Q680781) (← links)
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
• Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← 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)
• A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem (Q989843) (← links)
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
• Global optimization and multi knapsack: a percolation algorithm. (Q1420410) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem (Q1730435) (← links)
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
• The min-conflict packing problem (Q1761135) (← links)
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
• Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
• Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints (Q1781556) (← links)
• A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
• A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
• An ant colony optimization approach for the multidimensional knapsack problem (Q2267820) (← links)
• Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems (Q2371985) (← links)
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
• Single- and multi-objective defensive location problems on a network (Q2469584) (← links)
• A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
• Allocation of advertising space by a web service provider using combinatorial auctions (Q2571440) (← links)
• Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List (Q2773172) (← links)
• Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? (Q3304189) (← links)
• Modeling multiple plant sourcing decisions (Q3532786) (← links)
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
• Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)
• A dynamic tabu search for large-scale generalized assignment problems (Q5945334) (← links)
• A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack (Q6568952) (← links)
• Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets (Q6667807) (← links)