Pages that link to "Item:Q989828"
From MaRDI portal
The following pages link to Attraction probabilities in variable neighborhood search (Q989828):
Displaying 29 items.
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934) (← links)
- Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics (Q315502) (← links)
- A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem (Q463377) (← links)
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
- Variable neighborhood search for harmonic means clustering (Q636511) (← links)
- New heuristic for harmonic means clustering (Q887198) (← links)
- A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes (Q887203) (← links)
- A multi-start variable neighborhood search for solving the single path multicommodity flow problem (Q902982) (← links)
- Solving the capacitated clustering problem with variable neighborhood search (Q1730629) (← links)
- Candidate groups search for K-harmonic means data clustering (Q1792370) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- Less is more approach in optimization: a road to artificial intelligence (Q2070138) (← links)
- A new local search for continuous location problems (Q2255938) (← links)
- Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems (Q2669757) (← links)
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
- Generating good starting solutions for the \(p\)-median problem in the plane (Q2840779) (← links)
- Algorithms with greedy heuristic procedures for mixture probability distribution separation (Q3388410) (← links)
- A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage (Q4973250) (← links)
- A heuristic hybrid framework for vector job scheduling (Q4987672) (← links)
- Using injection points in reformulation local search for solving continuous location problems (Q4987696) (← links)
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)
- Hitting times of local and global optima in genetic algorithms with very high selection pressure (Q4987699) (← links)
- Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs (Q6049435) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
