Pages that link to "Item:Q970194"

The following pages link to Variable neighbourhood search: methods and applications (Q970194):

Displaying 50 items.

• A VNS approach to multi-location inventory redistribution with vehicle routing (Q1652123) (← links)
• Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap (Q1652132) (← links)
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352) (← links)
• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
• Generalization of the restricted planar location problems: unified metaheuristic algorithms (Q1654346) (← links)
• A general variable neighborhood search variants for the travelling salesman problem with draft limits (Q1677289) (← links)
• General variable neighborhood search for computing graph separators (Q1677293) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
• Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299) (← links)
• A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
• Selected short papers of the 4th international conference on variable neighborhood search (ICVNS'16), Malaga, Spain, October 3--5, 2016 (Q1682317) (← links)
• New heuristics for the bicluster editing problem (Q1686528) (← links)
• A general framework for nested variable neighborhood search (Q1687670) (← links)
• Exploring variable neighborhood search for automatic algorithm configuration (Q1687671) (← links)
• Scheduling preventive railway maintenance activities with resource constraints (Q1687684) (← links)
• Clustering approach in maintenance of capillary railway network (Q1687690) (← links)
• Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments (Q1707498) (← links)
• A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem (Q1730626) (← links)
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
• Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management (Q1730644) (← links)
• A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (Q1736555) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Across neighborhood search for numerical optimization (Q1750545) (← links)
• Layout optimisation for an installation port of an offshore wind farm (Q1751774) (← links)
• Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system (Q1752832) (← links)
• Clustering data that are graph connected (Q1753555) (← links)
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems (Q1753628) (← links)
• Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning (Q1754456) (← links)
• Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
• Efficient heuristics for the minimum labeling global cut problem (Q1791898) (← links)
• A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem (Q1791920) (← links)
• Variable neighborhood descent applied to multi-way number partitioning problem (Q1791923) (← links)
• A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time (Q1792653) (← links)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
• Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
• A variable neighborhood search algorithm for the leather nesting problem (Q1954576) (← links)
• A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section (Q1954820) (← links)
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods (Q2022209) (← links)