The following pages link to Variable neighborhood search (Q1374041):
Displayed 50 items.
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- Stabilized column generation (Q1297485) (← links)
- Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252) (← links)
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. (Q1406947) (← links)
- Guidelines for the use of meta-heuristics in combinatorial optimization. (Q1410607) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. (Q1410623) (← links)
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search. (Q1427560) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
- Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling (Q1761914) (← links)
- A hierarchical algorithm for the planar single-facility location routing problem (Q1761993) (← links)
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems (Q1762018) (← links)
- Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
- A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- Reformulation descent applied to circle packing problems (Q1772872) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- The extended concentric tabu for the quadratic assignment problem (Q1887907) (← links)
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Local search based heuristics for global optimization: atomic clusters and beyond (Q1926903) (← links)
- Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- Heuristic optimisation in financial modelling (Q1931632) (← links)
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
- Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
- A variable neighborhood search algorithm for the leather nesting problem (Q1954576) (← links)
- A new local search for continuous location problems (Q2255938) (← links)
- A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
- Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques (Q2256324) (← links)
- Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations (Q2257351) (← links)
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems (Q2257352) (← links)
- A location-routing problem in glass recycling (Q2259043) (← links)
- Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
- Neighborhood structures for the container loading problem: a VNS implementation (Q2267814) (← links)
- Merging the local and global approaches to probabilistic satisfiability (Q2270380) (← links)
- Industrial aspects and literature survey: Combined inventory management and routing (Q2270436) (← links)