Pages that link to "Item:Q4888241"
From MaRDI portal
The following pages link to Capacitated clustering problems by hybrid simulated annealing and tabu search (Q4888241):
Displayed 47 items.
- Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices (Q462781) (← links)
- An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- Model-based capacitated clustering with posterior regularization (Q724144) (← links)
- The band collocation problem (Q782758) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- The obnoxious \(p\) facility network location problem with facility interaction (Q1291604) (← links)
- A hybrid algorithm for identifying global and local minima when optimizing functions with many minima. (Q1428045) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
- Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem (Q1788935) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- Continuous optimization by a variant of simulated annealing (Q1918920) (← links)
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838) (← links)
- Dynamic tabu search strategies for the traveling purchaser problem (Q1919843) (← links)
- A tabu search algorithm for frequency assignment (Q1919845) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- The capacitated plant location problem with multiple facilities in the same site (Q1941959) (← links)
- An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
- Categorical data fuzzy clustering: an analysis of local search heuristics (Q2456635) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- Heuristic approaches to vehicle routing with backhauls and time windows (Q2564754) (← links)
- A scatter search heuristic for the capacitated clustering problem (Q2570154) (← links)
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)
- The capacitated centred clustering problem (Q2581607) (← links)
- A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
- Pharmacy duty scheduling problem (Q2811939) (← links)
- A New Composite Algorithm for Clustering Problems (Q4344451) (← links)
- A nested simulated annealing algorithm (Q4352563) (← links)
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
- Ant colony optimization for finding medians of weighted graphs (Q4908024) (← links)
- STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES (Q5055035) (← links)
- Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
- Local Search Algorithms for the Maximal Planar Layout Problem (Q5689972) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
- A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)
- Thirty years of <i>International Transactions in Operational Research</i>: past, present, and future direction (Q6056865) (← links)
- Systematic reviews as a metaknowledge tool: caveats and a review of available options (Q6056869) (← links)
- Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)