Pages that link to "Item:Q5937708"

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

Displaying 50 items.

• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
• A robust and efficient algorithm for planar competitive location problems (Q1026588) (← links)
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem (Q1027523) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
• Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm (Q1040788) (← links)
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods (Q1040972) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Vendor managed inventory for environments with stochastic product usage (Q1040988) (← links)
• Real-time control of freight forwarder transportation networks by integrating multimodal transport chains (Q1044090) (← links)
• A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems (Q1046124) (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
• Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. (Q1410623) (← links)
• Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
• Discovering patterns in time-varying graphs: a triclustering approach (Q1630871) (← links)
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← links)
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
• Special issue on variable neighborhood search methods in business and engineering (Q1652101) (← links)
• Bi-objective optimisation model for installation scheduling in offshore wind farms (Q1652103) (← links)
• A VNS approach to multi-location inventory redistribution with vehicle routing (Q1652123) (← links)
• Solving multifacility Huff location models on networks using metaheuristic and exact approaches (Q1652125) (← links)
• Variable neighborhood search variants for min-power symmetric connectivity problem (Q1652130) (← 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)
• Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem (Q1666220) (← links)
• A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints (Q1677303) (← links)
• Selected short papers of the 4th international conference on variable neighborhood search (ICVNS'16), Malaga, Spain, October 3--5, 2016 (Q1682317) (← links)
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
• VNS matheuristic for a bin packing problem with a color constraint (Q1687630) (← links)
• Exploring variable neighborhood search for automatic algorithm configuration (Q1687671) (← links)
• A variable neighborhood search algorithm for the capacitated vehicle routing problem (Q1687688) (← links)
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems (Q1694923) (← links)
• Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments (Q1707498) (← links)
• Heuristics for routing heterogeneous unmanned vehicles with fuel constraints (Q1717710) (← links)
• Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem (Q1718383) (← links)
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
• An efficient local search for the feedback vertex set problem (Q1736593) (← links)
• A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines (Q1743651) (← links)
• A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
• Layout optimisation for an installation port of an offshore wind farm (Q1751774) (← links)
• Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds (Q1751896) (← links)
• A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem (Q1752254) (← links)
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems (Q1753628) (← links)
• Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
• Managing the tabu list length using a fuzzy inference system: an application to examination timetabling (Q1761914) (← links)
• Large neighbourhood search algorithms for the founder sequence reconstruction problem (Q1761968) (← links)
• Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems (Q1762018) (← links)