Pages that link to "Item:Q1850963"
From MaRDI portal
The following pages link to Variable neighborhood decomposition search (Q1850963):
Displayed 50 items.
- Fast modified global \(k\)-means algorithm for incremental cluster construction (Q621088) (← links)
- Variable neighborhood search for harmonic means clustering (Q636511) (← links)
- Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Learning multicriteria fuzzy classification method PROAFTN from data (Q868128) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- Application of the cross-entropy method to clustering and vector quantization (Q868638) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803) (← links)
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems (Q936447) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Exemplar-based clustering via simulated annealing (Q1036142) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
- The maximum capture problem with random utilities: problem formulation and algorithms (Q1848399) (← links)
- Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474) (← links)
- A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
- An incremental clustering algorithm based on hyperbolic smoothing (Q2340498) (← links)
- Hybrid metaheuristic method for determining locations for long-term health care facilities (Q2347594) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm (Q2375528) (← links)
- Dynamic vehicle routing using an improved variable neighborhood search algorithm (Q2375629) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← 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)
- Categorical data fuzzy clustering: an analysis of local search heuristics (Q2456635) (← links)
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation (Q2479841) (← links)
- A fast swap-based local search procedure for location problems (Q2480210) (← links)
- A unified framework for partial and hybrid search methods in constraint programming (Q2489124) (← links)
- A metaheuristic to solve a location-routing problem with nonlinear costs (Q2491322) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Exploiting Separators for Guiding VNS (Q2840785) (← links)
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility (Q2883646) (← links)
- An iterative local search approach applied to the optimal stratification problem (Q3002556) (← links)
- On the integrated charge planning with flexible jobs in primary steelmaking processes (Q3163146) (← links)
- Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
- An algorithm for minimizing clustering functions (Q5317732) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)