A black-box scatter search for optimization problems with integer variables
From MaRDI portal
Recommendations
- Black box scatter search for general classes of binary optimization problems
- A method for convex black-box integer global optimization
- Black-box combinatorial optimization using models with integer-valued minima
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- Integer optimization by local search. A domain-independent approach
- Black-box optimization in an extended search space for SAT solving
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Implicitly and densely discrete black-box optimization problems
- A survey on direct search methods for blackbox optimization and their applications
- A DE-based scatter search for global optimization problems
Cites work
- scientific article; zbMATH DE number 1702339 (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 1488097 (Why is no real title available?)
- scientific article; zbMATH DE number 3238209 (Why is no real title available?)
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A Memetic Algorithm for Water Distribution Network Design
- A class of bounded approximation algorithms for graph partitioning
- A distribution-free approach to inducing rank correlation among input variables
- A variable neighbourhood search algorithm for the constrained task allocation problem
- Adaptive memory programming: a unified view of metaheuristics
- Black box scatter search for general classes of binary optimization problems
- Context-independent scatter and tabu search for permutation problems
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Heuristics for the bandwidth colouring problem
- Hybrid scatter tabu search for unconstrained global optimization
- Hybridizing the cross-entropy method: An application to the max-cut problem
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Scatter search. Methodology and implementation in C. With CD-ROM.
- The challenge of optimizing expensive black boxes: a scatter search/rough set theory approach
Cited in
(12)- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- The challenge of optimizing expensive black boxes: a scatter search/rough set theory approach
- Derivative-free methods for mixed-integer constrained optimization problems
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A derivative-free approach for a simulation-based optimization problem in healthcare
- Black box scatter search for general classes of binary optimization problems
- A heuristic algorithm for a supply chain's production-distribution planning
- Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique
- The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
- A metaheuristic for a numerical approximation to the mass transfer problem
This page was built for publication: A black-box scatter search for optimization problems with integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742141)
