Black box scatter search for general classes of binary optimization problems
From MaRDI portal
Publication:976017
DOI10.1016/j.cor.2010.01.013zbMath1188.90278MaRDI QIDQ976017
Manuel Laguna, Rafael Martí, Abraham Duarte, Francisco Gortazar
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.01.013
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A black-box scatter search for optimization problems with integer variables, Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem, Iterated greedy for the maximum diversity problem, A hybrid metaheuristic method for the maximum diversity problem, A review on algorithms for maximum clique problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The transform likelihood ratio method for rare event simulation with heavy tails
- Tabu search and GRASP for the maximum diversity problem
- Hybridizing the cross-entropy method: An application to the max-cut problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- An improved simulated annealing simulation optimization method for discrete parameter stochastic systems
- Adaptive memory search for multidemand multidimensional knapsack problems
- Hybrid heuristics for the maximum diversity problem
- Core Problems in Knapsack Algorithms
- A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
- A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
- Context-Independent Scatter and Tabu Search for Permutation Problems
- Advanced Scatter Search for the Max-Cut Problem
- Randomized heuristics for the Max-Cut problem
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
