The following pages link to Variable neighborhood search (Q1374041):
Displaying 50 items.
- Robust vehicle routing problem with hard time windows under demand and travel time uncertainty (Q1652619) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
- An algorithmic framework for generating optimal two-stratum experimental designs (Q1658390) (← links)
- DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems (Q1665588) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← 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 solving a multiproduct EOQ-based inventory problem with storage space constraints (Q1677303) (← links)
- A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps (Q1681355) (← links)
- The static bike relocation problem with multiple vehicles and visits (Q1681499) (← links)
- The probabilistic \(p\)-center problem: planning service for potential customers (Q1683071) (← links)
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
- Automatic integer programming reformulation using variable neighborhood search (Q1687624) (← links)
- A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities (Q1687626) (← links)
- Variable neighborhood search accelerated column generation for the nurse rostering problem (Q1687629) (← links)
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem (Q1687640) (← links)
- A variable neighborhood search approach for the crew pairing problem (Q1687651) (← links)
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges (Q1687653) (← links)
- A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem (Q1687655) (← links)
- Variable neighborhood search algorithms for pickup and delivery problems with loading constraints (Q1687656) (← links)
- Variable neighborhood search for optimizing the transportation of agricultural raw materials (Q1687665) (← links)
- Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic (Q1687668) (← links)
- On the aircraft conflict resolution problem: a VNS approach in a multiobjective framework (Q1687669) (← links)
- New VNP for automatic programming (Q1687679) (← links)
- A performance study on multi improvement neighborhood search strategy (Q1687681) (← links)
- Drawing graphs with mathematical programming and variable neighborhood search (Q1687683) (← links)
- Scheduling preventive railway maintenance activities with resource constraints (Q1687684) (← links)
- A variable neighborhood search algorithm for the capacitated vehicle routing problem (Q1687688) (← links)
- Clustering approach in maintenance of capillary railway network (Q1687690) (← links)
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
- Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
- General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
- Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions (Q1698296) (← links)
- Sampling and learning Mallows and generalized Mallows models under the Cayley distance (Q1703017) (← links)
- Order-based error for managing ensembles of surrogates in mesh adaptive direct search (Q1704921) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← 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)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- Heuristics for routing heterogeneous unmanned vehicles with fuel constraints (Q1717710) (← links)
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems (Q1725606) (← links)