The following pages link to Variable neighborhood search (Q1374041):
Displaying 50 items.
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← links)
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints (Q2275601) (← links)
- Hyper-heuristic approaches for the response time variability problem (Q2275609) (← links)
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems (Q2275813) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion (Q2287157) (← links)
- Variable neighborhood search for graphical model energy minimization (Q2287189) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Modeling two-stage UHL problem with uncertain demands (Q2289309) (← links)
- Handling fairness issues in time-relaxed tournaments with availability constraints (Q2289924) (← links)
- The location routing problem using electric vehicles with constrained distance (Q2289942) (← links)
- Matheuristic for the decentralized factories scheduling problem (Q2290271) (← links)
- Mitigating partial-disruption risk: a joint facility location and inventory model considering customers' preferences and the role of substitute products and backorder offers (Q2297567) (← links)
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
- A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing (Q2301940) (← links)
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
- Vehicle routing with transportable resources: using carpooling and walking for on-site services (Q2315653) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection (Q2331437) (← links)
- Solution techniques for the inter-modal pickup and delivery problem in two regions (Q2333155) (← links)
- An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study (Q2337384) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- Hybrid metaheuristic method for determining locations for long-term health care facilities (Q2347594) (← links)
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces (Q2355716) (← links)
- Time series interpolation via global optimization of moments fitting (Q2355921) (← links)
- Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Iterative approaches for a dynamic memory allocation problem in embedded systems (Q2356204) (← links)
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization (Q2358022) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms (Q2359156) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- A variable neighborhood search heuristic for periodic routing problems (Q2378420) (← links)
- A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- Solving a capacitated hub location problem (Q2384615) (← links)
- A variable neighborhood search for the network design problem with relays (Q2403270) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- Learning variable neighborhood search for a scheduling problem with time windows and rejections (Q2414479) (← links)
- A directional approach to gradual cover (Q2421326) (← links)
- Variable neighborhood search for stochastic linear programming problem with quantile criterion (Q2423821) (← links)
- Algorithms for single machine total tardiness scheduling with sequence dependent setups (Q2433437) (← links)
- A variable neighborhood decomposition search method for supply chain management planning problems (Q2433455) (← links)
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)