Black box scatter search for general classes of binary optimization problems

DOI10.1016/J.COR.2010.01.013zbMATH Open1188.90278OpenAlexW2030190608MaRDI QIDQ976017FDOQ976017

Abraham Duarte, Manuel Laguna, Rafael Martí, 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

Recommendations

• A black-box scatter search for optimization problems with integer variables
• scientific article; zbMATH DE number 2209655
• Scatter search for chemical and bio-process optimization
• Scatter Search and Path Relinking: Advances and Applications
• scientific article; zbMATH DE number 2209646

zbMATH Keywords

optimizationmetaheuristicshard optimization problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Context-independent scatter and tabu search for permutation problems
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Hybridizing the cross-entropy method: An application to the max-cut problem
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• Adaptive memory search for multidemand multidimensional knapsack problems
• Core problems in knapsack algorithms
• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Tabu search and GRASP for the maximum diversity problem
• A hybrid GRASP with perturbations for the Steiner problem in graphs
• Advanced scatter search for the max-cut problem
• Randomized heuristics for the Max-Cut problem
• The transform likelihood ratio method for rare event simulation with heavy tails
• An improved simulated annealing simulation optimization method for discrete parameter stochastic systems
• Hybrid heuristics for the maximum diversity problem

Cited In (9)

• Iterated greedy for the maximum diversity problem
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
• A black-box scatter search for optimization problems with integer variables
• Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique
• Black-box optimization in an extended search space for SAT solving
• A hybrid metaheuristic method for the maximum diversity problem
• A review on algorithms for maximum clique problems
• Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
• Generalised Sifting in Black-Box Groups

Uses Software

• Knapsack
• Scatter Search
• Excel

This page was built for publication: Black box scatter search for general classes of binary optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976017)