Pages that link to "Item:Q2731676"

The following pages link to Fundamentals of scatter search and path relinking (Q2731676):

Displaying 50 items.

• Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem (Q1665302) (← links)
• An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
• Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges (Q1737486) (← links)
• An effective heuristic for project scheduling with resource availability cost (Q1752859) (← links)
• A knapsack problem as a tool to solve the production planning problem in small foundries (Q1761949) (← links)
• Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
• An experimental evaluation of a scatter search for the linear ordering problem (Q1850839) (← links)
• Scatter search and star-paths: Beyond the genetic metaphor (Q1908997) (← links)
• On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
• A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions (Q2029093) (← links)
• On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
• A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem (Q2108168) (← links)
• Robust min-max regret covering problems (Q2162527) (← links)
• Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
• A new bi-objective fuzzy portfolio selection model and its solution through evolutionary algorithms (Q2318256) (← links)
• Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• A project portfolio selection problem in a group decision-making context (Q2358859) (← links)
• Finding local optima of high-dimensional functions using direct search methods (Q2378372) (← links)
• Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← links)
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
• New heuristic algorithms for the windy rural postman problem (Q2387296) (← links)
• Heuristics for urban road network design: lane layout and signal settings (Q2433540) (← links)
• Artificial life techniques for load balancing in computational grids (Q2459370) (← links)
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem (Q2459404) (← links)
• The development of a multi-objective tabu search algorithm for continuous optimisation problems (Q2464204) (← links)
• Parallel metaheuristics for workforce planning (Q2466392) (← links)
• A bi-objective reverse logistics network analysis for post-sale service (Q2471234) (← links)
• A fast swap-based local search procedure for location problems (Q2480210) (← links)
• A scatter search approach for the minimum sum-of-squares clustering problem (Q2485180) (← links)
• Parametric tabu-search for mixed integer programs (Q2489300) (← links)
• Minimizing labor requirements in a periodic vehicle loading problem (Q2490369) (← links)
• Path relinking for the vehicle routing problem (Q2491329) (← links)
• A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling (Q2519076) (← links)
• Scatter search --- wellsprings and challenges (Q2570140) (← links)
• Principles of scatter search (Q2570141) (← links)
• Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms (Q2570144) (← links)
• Scatter search with path relinking for phylogenetic inference (Q2570151) (← links)
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)
• Scatter search for the vehicle routing problem with time windows (Q2570159) (← links)
• Scatter search for project scheduling with resource availability cost (Q2570160) (← links)
• A hybrid scatter search/electromagnetism meta-heuristic for project scheduling (Q2570161) (← links)
• Comparing metaheuristic algorithms for SONET network design problems (Q2573001) (← links)
• A GRASP and path relinking heuristic for rural road network development (Q2573003) (← links)
• A scatter search algorithm for time-dependent prize-collecting arc routing problems (Q2669496) (← links)
• Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)