Solution-based versus attribute-based tabu search for binary integer programming
From MaRDI portal
Cites work
- A genetic algorithm for the multidimensional knapsack problem
- A heuristic for Boolean optimization problems
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- A note on hashing functions and tabu search algorithms
- A Spectral Bundle Method for Semidefinite Programming
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Advanced scatter search for the max-cut problem
- Construction and improvement algorithms for dispersion problems
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Exponential extrapolation memory for tabu search
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- Fifty years of metaheuristics
- Hashing vectors for tabu search
- scientific article; zbMATH DE number 3624650 (Why is no real title available?)
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- Measuring the impact of primal heuristics
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
- Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
- Randomized heuristics for the Max-Cut problem
- The board packing problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
This page was built for publication: Solution-based versus attribute-based tabu search for binary integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972008)
