Pages that link to "Item:Q5937708"

The following pages link to Variable neighborhood search: Principles and applications (Q5937708):

Displaying 50 items.

• A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179) (← links)
• Similarities between meta-heuristics algorithms and the science of life (Q441019) (← links)
• Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem (Q447561) (← links)
• Functional data clustering via piecewise constant nonparametric density estimation (Q454427) (← links)
• A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) (← links)
• Column generation bounds for numerical microaggregation (Q486386) (← links)
• Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks (Q490355) (← links)
• A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
• An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics (Q491075) (← links)
• A filling function method for unconstrained global optimization (Q493693) (← links)
• Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
• Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
• Assigning judges to competitions of several rounds using tabu search (Q541731) (← links)
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
• Point-to-point shortest paths on dynamic time-dependent road networks (Q607878) (← links)
• Space and time allocation in a shipyard assembly hall (Q610963) (← links)
• Ambulance location and relocation problems with time-dependent travel times (Q613443) (← links)
• Metaheuristic methods based on tabu search for assigning judges to competitions (Q613764) (← links)
• Design of highly synchronizable and robust networks (Q620598) (← links)
• A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
• Variable neighborhood search for harmonic means clustering (Q636511) (← links)
• A unified framework for population-based metaheuristics (Q646652) (← links)
• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads (Q681292) (← links)
• The heterogeneous \(p\)-median problem for categorization based clustering (Q692416) (← links)
• Variable neighborhood search for the maximum clique (Q705505) (← links)
• A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← links)
• Heuristic methods for the optimal statistic median problem (Q709155) (← links)
• Multiobjective optimization for multimode transportation problems (Q721075) (← links)
• Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem (Q724004) (← links)
• Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning (Q726254) (← links)
• Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
• Optimum simultaneous discretization with data grid models in supervised classification: a Bayesian model selection approach (Q734519) (← links)
• Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
• SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications (Q743971) (← links)
• A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
• Transshipment service through crossdocks with both soft and hard time windows (Q763197) (← links)
• Objective function features providing barriers to rapid global optimization (Q813354) (← links)
• Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
• A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
• New neighborhood structures for the double traveling salesman problem with multiple stacks (Q839902) (← links)
• Delivery strategies for blood products supplies (Q841585) (← links)
• Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
• A multi-objective evolutionary algorithm for examination timetabling (Q842554) (← links)