Pages that link to "Item:Q1029572"

The following pages link to Variable neighbourhood search: Methods and applications (Q1029572):

Displaying 50 items.

• Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm (Q260652) (← links)
• A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
• Fast local search for single row facility layout (Q319872) (← links)
• Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
• A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry (Q336374) (← links)
• Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
• Scheduled penalty variable neighborhood search (Q337204) (← links)
• Multi-instance classification through spherical separation and VNS (Q337238) (← links)
• Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
• Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
• The dynamic vehicle allocation problem with application in trucking companies in Brazil (Q342558) (← links)
• A recipe for finding good solutions to MINLPs (Q384810) (← links)
• A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
• A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
• Column generation bounds for numerical microaggregation (Q486386) (← links)
• A survey on optimization metaheuristics (Q497180) (← links)
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
• A global optimization method for the design of space trajectories (Q538297) (← links)
• A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
• Variable neighborhood search for harmonic means clustering (Q636511) (← links)
• An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
• Classification of applied methods of combinatorial optimization (Q844352) (← links)
• New heuristic for harmonic means clustering (Q887198) (← links)
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
• A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes (Q887203) (← links)
• Fitting censored quantile regression by variable neighborhood search (Q887210) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
• Attraction probabilities in variable neighborhood search (Q989828) (← links)
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem (Q992718) (← links)
• An approach of the exact linearization techniques to analysis of population dynamics of the mosquito Aedes aegypti (Q1642119) (← links)
• A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations (Q1652116) (← links)
• DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems (Q1665588) (← links)
• A general variable neighborhood search variants for the travelling salesman problem with draft limits (Q1677289) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
• A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
• Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect (Q1687634) (← links)
• Variable neighborhood descent for the incremental graph drawing (Q1687677) (← links)
• Clustering approach in maintenance of capillary railway network (Q1687690) (← links)
• Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
• General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
• Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments (Q1707498) (← links)
• Surveys in operations research (Q1730527) (← links)
• Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
• Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties (Q1791909) (← links)
• Heuristic approaches to the distinguishing substring selection problem (Q1791942) (← links)
• A GVNS algorithm for solving the multi-depot vehicle routing problem (Q1791946) (← links)