Pages that link to "Item:Q1850963"
From MaRDI portal
The following pages link to Variable neighborhood decomposition search (Q1850963):
Displaying 50 items.
- Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks (Q310353) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- The stochastic capacitated branch restructuring problem (Q512982) (← links)
- Fast modified global \(k\)-means algorithm for incremental cluster construction (Q621088) (← links)
- Variable neighborhood search for harmonic means clustering (Q636511) (← links)
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system (Q781099) (← 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)
- 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)
