The following pages link to Variable neighborhood search (Q1374041):
Displayed 50 items.
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices (Q2462311) (← links)
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule (Q2464208) (← links)
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem (Q2470097) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems (Q2475846) (← links)
- On bags and bugs (Q2482094) (← links)
- A unified framework for partial and hybrid search methods in constraint programming (Q2489124) (← links)
- On-line resources allocation for ATM networks with rerouting (Q2489130) (← links)
- Variable neighborhood search and local branching (Q2489139) (← links)
- Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
- A survey of local search methods for graph coloring (Q2489304) (← links)
- Scheduling workover rigs for onshore oil production (Q2489895) (← links)
- First vs. best improvement: an empirical study (Q2489903) (← links)
- A probabilistic cooperative-competitive hierarchical model for global optimization (Q2493692) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- Skewed bivariate models and nonparametric estimation for the CTE risk measure (Q2518541) (← links)
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times (Q2519079) (← links)
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
- MOAQ and ant-Q algorithm for multiple objective optimization problems (Q2573012) (← links)
- Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill (Q2575581) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- Multiobjective GRASP with path relinking (Q2629598) (← links)
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time (Q2629637) (← links)
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory (Q2629705) (← links)
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit (Q2630092) (← links)
- A hybrid VND method for the split delivery vehicle routing problem (Q2631222) (← links)
- Variable neighbourhood search for the \(k\)-labelled spanning forest problem (Q2631224) (← links)
- A generalized variable neighborhood search for combinatorial optimization problems (Q2631228) (← links)
- General variable neighborhood search applied to the picking process in a warehouse (Q2631231) (← links)
- VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems (Q2631235) (← links)
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search (Q2631238) (← links)
- VNS approach for solving a financial portfolio design problem (Q2631242) (← links)
- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search (Q2631247) (← links)
- A variable neighborhood search method for solving the traveling tournaments problem (Q2631249) (← links)
- New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent (Q2631255) (← links)
- A hybrid variable neighborhood search algorithm for targeted offers in direct marketing (Q2631264) (← links)
- A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities (Q2631272) (← links)
- VNS variants for the Max-Mean dispersion problem (Q2631281) (← links)
- A variable neighborhood search for solving the multi-vehicle covering tour problem (Q2631288) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
- Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
- Optimization model applied to radiotherapy planning problem with dose intensity and beam choice (Q2660085) (← links)
- A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
- A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection (Q2664335) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption (Q2668648) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)