The following pages link to Variable neighborhood search (Q1374041):
Displayed 50 items.
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem (Q953320) (← links)
- A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation (Q953839) (← links)
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking (Q954039) (← links)
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (Q955318) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Alternating local search based VNS for linear classification (Q970175) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645) (← links)
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (Q976005) (← links)
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (Q976011) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- Nordhaus-Gaddum relations for proximity and remoteness in graphs (Q988253) (← links)
- Vehicle dispatching algorithms for container transshipment hubs (Q989625) (← links)
- Mathematical models and solution methods for optimal container terminal yard layouts (Q989631) (← links)
- Attraction probabilities in variable neighborhood search (Q989828) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application (Q991831) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem (Q992718) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
- A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
- Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
- The traveling purchaser problem with budget constraint (Q1013406) (← links)
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- Norm statistics and the complexity of clustering problems (Q1026145) (← links)
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem (Q1027523) (← links)
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← links)
- Corrigendum to ``Variable space search for graph coloring'' [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)] (Q1028098) (← links)
- A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
- The impact of parametrization in memetic evolutionary algorithms (Q1029357) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies (Q1037659) (← links)
- A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- Vendor managed inventory for environments with stochastic product usage (Q1040988) (← 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)