Pages that link to "Item:Q5937708"

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

Displaying 50 items.

• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
• Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
• A fuzzy sets based generalization of contact maps for the overlap of protein structures (Q1776513) (← links)
• Hybrid VNS heuristics for the production scheduling of costumes for Brazilian carnival samba schools (Q1791903) (← links)
• On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application (Q1791912) (← links)
• Candidate groups search for K-harmonic means data clustering (Q1792370) (← links)
• Computers and discovery in algebraic graph theory (Q1855400) (← links)
• Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
• A list-based compact representation for large decision tables management (Q1885753) (← links)
• Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
• Embedded local search approaches for routing optimization (Q1886851) (← links)
• The extended concentric tabu for the quadratic assignment problem (Q1887907) (← links)
• A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
• A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty (Q1926975) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
• Bayesian instance selection for the nearest neighbor rule (Q1959627) (← links)
• Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
• Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops (Q2018107) (← links)
• GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
• A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
• Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
• Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems (Q2056575) (← links)
• On solving the order processing in picking workstations (Q2070114) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Portfolio decision analysis with a generalized balance approach (Q2146968) (← links)
• Modelling and solving the milk collection problem with realistic constraints (Q2147008) (← links)
• Models for government intervention during a pandemic (Q2171541) (← links)
• A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices (Q2171595) (← links)
• E-platooning: optimizing platoon formation for long-haul transportation with electric commercial vehicles (Q2171599) (← links)
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
• A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
• Strategic planning of an underground mine with variable cut-off grades (Q2218873) (← links)
• Degree-constrained \(k\)-minimum spanning tree problem (Q2221985) (← links)
• Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm (Q2240047) (← links)
• A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
• Metaheuristics ``In the large'' (Q2242238) (← links)
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems (Q2253990) (← links)
• A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
• Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques (Q2256324) (← links)
• A location-routing problem in glass recycling (Q2259043) (← links)
• A mesh adaptive direct search algorithm for multiobjective optimization (Q2267660) (← links)
• A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)