Pages that link to "Item:Q970194"

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

Displaying 50 items.

• A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
• Heuristic algorithms for solving an integrated dynamic center facility location -- network design model (Q301077) (← links)
• Surgical scheduling with simultaneous employment of specialised human resources (Q319663) (← links)
• Fast local search for single row facility layout (Q319872) (← links)
• Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem (Q320805) (← links)
• Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
• A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
• A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem (Q324311) (← links)
• Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
• DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization (Q337202) (← links)
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
• A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions (Q337215) (← links)
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
• A two phase variable neighborhood search for the multi-product inventory routing problem (Q337230) (← links)
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
• Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
• An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
• A quadtree-based allocation method for a class of large discrete Euclidean location problems (Q337393) (← links)
• Variable neighborhood search for location routing (Q339539) (← links)
• Variable neighborhood search for the vertex separation problem (Q339678) (← links)
• The multimode covering location problem (Q342251) (← links)
• A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
• The multiple team formation problem using sociometry (Q342525) (← links)
• On the extremal properties of the average eccentricity (Q356266) (← links)
• Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
• A survey on optimization metaheuristics (Q497180) (← links)
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
• J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
• General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
• Water distribution networks design under uncertainty (Q526639) (← links)
• A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
• Recent trends in metaheuristics for stochastic combinatorial optimization (Q692975) (← links)
• Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance (Q723980) (← links)
• Transshipment service through crossdocks with both soft and hard time windows (Q763197) (← links)
• Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
• A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
• Fitting censored quantile regression by variable neighborhood search (Q887210) (← links)
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation (Q1652021) (← links)
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
• Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems (Q1652102) (← links)
• Bi-objective optimisation model for installation scheduling in offshore wind farms (Q1652103) (← links)
• Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem (Q1652109) (← links)
• A general variable neighborhood search for the swap-body vehicle routing problem (Q1652113) (← links)
• Variable neighborhood search strategies for the order batching problem (Q1652118) (← links)
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
• 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)