The following pages link to Handbook of metaheuristics (Q5917497):
Displaying 50 items.
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
- Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem (Q1042203) (← links)
- Energy intake functions and energy budgets of ectotherms and endotherms derived from their ontogenetic growth in body mass and timing of sexual maturation (Q1649457) (← links)
- A hybrid genetic approach for solving an integrated multi-objective operating room planning and scheduling problem (Q1652429) (← links)
- DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems (Q1665588) (← links)
- Heuristic algorithms for joint optimization of unicast and anycast traffic in elastic optical network-based large-scale computing systems (Q1676206) (← links)
- Solving the examination timetabling problem in GPUs (Q1736620) (← links)
- RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← links)
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- On single-walk parallelization of the job shop problem solving algorithms (Q1761161) (← links)
- Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
- Linear combinations of heuristics for examination timetabling (Q1761893) (← links)
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767) (← links)
- Reformulation descent applied to circle packing problems (Q1772872) (← links)
- Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems (Q1772975) (← links)
- Exact and heuristic procedures for solving the fuzzy portfolio selection problem (Q1927253) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- A new model and a hyper-heuristic approach for two-dimensional shelf space allocation (Q1942009) (← links)
- Optimizing inventory decisions in a two-level supply chain with order quantity constraints (Q1991466) (← links)
- A hybrid algorithm for solving inverse problems in elasticity (Q2018413) (← links)
- A novel 3D atomistic-continuum cancer invasion model: in silico simulations of an \textit{in vitro} organotypic invasion assay (Q2029564) (← links)
- A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data (Q2070120) (← links)
- Non-dominated solutions for time series learning and forecasting. Generating models with a generic two-phase Pareto loca search with VND (Q2070137) (← links)
- Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints (Q2083384) (← links)
- Global sensing search for nonlinear global optimization (Q2124800) (← links)
- A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences (Q2160676) (← links)
- Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms (Q2218447) (← links)
- Mini-batch adaptive random search method for the parametric identification of dynamic systems (Q2229530) (← links)
- Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem (Q2250117) (← links)
- An ellipsoidal distance-based search strategy of ants for nonlinear single and multiple response optimization problems (Q2253350) (← links)
- An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances (Q2256244) (← links)
- A survey of hybrid metaheuristics for the resource-constrained project scheduling problem (Q2273894) (← links)
- \(K\)-means cloning: adaptive spherical \(K\)-means clustering (Q2283822) (← links)
- A time-dependent hierarchical Chinese postman problem (Q2303339) (← links)
- Solving the general employee scheduling problem (Q2333146) (← links)
- Towards an efficient resolution of printing problems (Q2339840) (← links)
- Approximate credal network updating by linear programming with applications to decision making (Q2344362) (← links)
- Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
- Finding local optima of high-dimensional functions using direct search methods (Q2378372) (← links)
- Integrated forward/reverse logistics network design under uncertainty with pricing for collection of used products (Q2399316) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- Lot sizing and furnace scheduling in small foundries (Q2456652) (← links)
- Operations research and data mining (Q2467295) (← links)
- A bi-objective coordination setup problem in a two-stage production system (Q2482750) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
