Pages that link to "Item:Q1850963"
From MaRDI portal
The following pages link to Variable neighborhood decomposition search (Q1850963):
Displayed 50 items.
- 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)
- Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (Q1736555) (← 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)
- Variable neighborhood descent applied to multi-way number partitioning problem (Q1791923) (← 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)
- Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474) (← links)
- Improved metaheuristics for the quartet method of hierarchical clustering (Q2022207) (← links)
- Revenue maximization of Internet of things provider using variable neighbourhood search (Q2022217) (← links)
- Integrating order delivery and return operations for order fulfillment in an online retail environment (Q2147018) (← 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)
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← 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 Investigation on Compound Neighborhoods for VRPTW (Q2980168) (← 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)
- Heuristics for Location Models (Q5506730) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)