The following pages link to Variable neighborhood search (Q1374041):
Displaying 50 items.
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- Stabilized column generation (Q1297485) (← links)
- Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252) (← links)
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. (Q1406947) (← links)
- Guidelines for the use of meta-heuristics in combinatorial optimization. (Q1410607) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. (Q1410623) (← links)
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search. (Q1427560) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
- A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis (Q1623574) (← links)
- The planar multifacility collection depots location problem (Q1628125) (← links)
- Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
- A revised variable neighborhood search for the discrete ordered median problem (Q1634286) (← links)
- A VNS-LP algorithm for the robust dynamic maximal covering location problem (Q1642060) (← links)
- Stochastic model of the electric power purchase system on a railway segment (Q1647288) (← links)
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic (Q1651546) (← links)
- Solving the bus evacuation problem and its variants (Q1651627) (← links)
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
- The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
- Lane covering with partner bounds in collaborative truckload transportation procurement (Q1652017) (← links)
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
- A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← links)
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
- Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks (Q1652107) (← links)
- The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search (Q1652112) (← 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)
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign (Q1652137) (← links)
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142) (← links)
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
- Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm (Q1652273) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- A variable neighborhood search algorithm for the surgery tactical planning problem (Q1652340) (← links)
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352) (← links)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)