An efficient tabu search approach for the 0-1 multidimensional knapsack problem
From MaRDI portal
Publication:1609923
DOI10.1016/S0377-2217(97)00296-8zbMath0991.90089MaRDI QIDQ1609923
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems, Une approche hybride pour le sac à dos multidimensionnel en variables 0–1, Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm, Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem, An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem, Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm, A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators, A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem, Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, Global optimization and multi knapsack: a percolation algorithm., Modeling multiple plant sourcing decisions, The multidimensional 0-1 knapsack problem: an overview., Scatter search for the 0-1 multidimensional knapsack problem, Solving a novel inventory location model with stochastic constraints and \((R,s,S)\) inventory control policy, Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem, Essential particle swarm optimization queen with tabu search for MKP resolution, A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?, Single- and multi-objective defensive location problems on a network, Parameter tuning for local-search-based matheuristic methods, Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem, Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method, The min-conflict packing problem, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints, A 3-flip neighborhood local search for the set covering problem, Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List, Kernel search: a general heuristic for the multi-dimensional knapsack problem, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, An ant colony optimization approach for the multidimensional knapsack problem, A dynamic tabu search for large-scale generalized assignment problems, Improved results on the 0--1 multidimensional knapsack problem, Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints, A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem, A comparative analysis of two matheuristics by means of merged local optima networks, An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem, Allocation of advertising space by a web service provider using combinatorial auctions, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- ``Neural computation of decisions in optimization problems
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- The noising method: A new method for combinatorial optimization
- An exact algorithm for the 0-1 collapsing knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- Future paths for integer programming and links to artificial intelligence
- Local search with memory: Benchmarking RTS
- Dynamic tabu list management using the reverse elimination method
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- Pivot and Complement–A Heuristic for 0-1 Programming
- Calculating surrogate constraints
- Tabu Search—Part I
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- The Reactive Tabu Search
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
- Tabu search within a pivot and complement framework
- Equation of State Calculations by Fast Computing Machines
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- The Theory and Computation of Knapsack Functions
