The following pages link to Handbook of metaheuristics (Q5917497):
Displaying 50 items.
- A heuristic for solving large bin packing problems in two and three dimensions (Q300728) (← links)
- A branch-price-and-cut algorithm for the minimum evolution problem (Q319451) (← links)
- A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects (Q336434) (← links)
- Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
- A tabu search algorithm for application placement in computer clustering (Q337070) (← links)
- Energy-oriented scheduling based on evolutionary algorithms (Q337370) (← links)
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
- Multi-operator based biogeography based optimization with mutation for global numerical optimization (Q356256) (← links)
- Using multi-objective evolutionary algorithms for single-objective optimization (Q385470) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review (Q460389) (← links)
- A perturbed martingale approach to global optimization (Q468044) (← links)
- On solving the forward kinematics of 3RPR planar parallel manipulator using hybrid metaheuristics (Q547959) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- Autonomous operator management for evolutionary algorithms (Q604944) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration (Q611516) (← links)
- A unified framework for population-based metaheuristics (Q646652) (← links)
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- A perturb biogeography based optimization with mutation for global numerical optimization (Q720655) (← links)
- An evolutionary method for complex-process optimization (Q732898) (← links)
- A rough set approach to feature selection based on scatter search metaheuristic (Q741887) (← links)
- An automatic multilevel image thresholding using relative entropy and meta-heuristic algorithms (Q742752) (← links)
- Learning compact zero-order TSK fuzzy rule-based systems for high-dimensional problems using an apriori \(+\) local search approach (Q781936) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- A simulation-based multi-objective genetic algorithm (SMOGA) procedure for BOT network design problem (Q862494) (← links)
- A multi-objective production scheduling case study solved by simulated annealing (Q863984) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- On initial populations of a genetic algorithm for continuous optimization problems (Q878224) (← links)
- Genetic algorithms to solve the cover printing problem (Q883299) (← links)
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem (Q992718) (← links)
- Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
- A route set construction algorithm for the transit network design problem (Q1010301) (← links)
- Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
- Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
- A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization (Q1015314) (← links)
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems (Q1026761) (← links)
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem (Q1027523) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report (Q1038282) (← links)
