Pages that link to "Item:Q1012715"

The following pages link to Tuning metaheuristics. A machine learning Perspective (Q1012715):

Displaying 36 items.

• Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
• Region based memetic algorithm for real-parameter optimisation (Q903616) (← links)
• Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← links)
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
• An efficient algorithm for unconstrained optimization (Q1664864) (← links)
• A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem (Q1728477) (← links)
• New genetic algorithm approach for the MIN-degree constrained minimum spanning tree (Q1751721) (← links)
• A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
• Collaborative vehicle routing: a survey (Q1754297) (← links)
• Large neighbourhood search algorithms for the founder sequence reconstruction problem (Q1761968) (← links)
• Synergies between operations research and data mining: the emerging use of multi-objective approaches (Q1926877) (← links)
• An optimization algorithm inspired by social creativity systems (Q1930872) (← links)
• Review on nature-inspired algorithms (Q1981936) (← links)
• Methods for improving the efficiency of swarm optimization algorithms. A survey (Q1982839) (← links)
• Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms (Q2029299) (← links)
• Rollout-based routing strategies with embedded prediction: a fish trawling application (Q2108157) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• A joint problem of strategic workforce planning and fleet renewal: with an application in defense (Q2242307) (← links)
• Automatically improving the anytime behaviour of optimisation algorithms (Q2256321) (← links)
• OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms (Q2393125) (← links)
• Adaptation of the method of musical composition for solving the multiple sequence alignment problem (Q2516112) (← links)
• Runtime analysis for self-adaptive mutation rates (Q2661995) (← links)
• Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
• A heuristic and an exact method for the gate matrix connection cost minimization problem (Q2862155) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems (Q5140142) (← links)
• Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
• MPILS: an automatic tuner for MILP solvers (Q6047892) (← links)
• Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
• Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
• Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems (Q6069740) (← links)
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
• A multilevel evaluation method for heuristics with an application to the VRPTW (Q6088238) (← links)
• Automatic performance tuning for Albany Land Ice (Q6136552) (← links)