A reactive GRASP with path relinking for capacitated clustering
From MaRDI portal
Publication:535394
DOI10.1007/S10732-010-9129-ZzbMATH Open1211.90301OpenAlexW2047569698MaRDI QIDQ535394FDOQ535394
Authors: Y.-M. Deng, Jonathan F. Bard 
Publication date: 11 May 2011
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-010-9129-z
Recommendations
- Heuristic search to the capacitated clustering problem
- A scatter search heuristic for the capacitated clustering problem
- Clustering search algorithm for the capacitated centered clustering problem
- Greedy random adaptive memory programming search for the capacitated clustering problem
- Tabu search and GRASP for the capacitated clustering problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- A column generation approach to capacitated \(p\)-median problems
- Using clustering analysis in a capacitated location-routing problem
- Variable neighborhood search
- Fundamentals of scatter search and path relinking
- Title not available (Why is that?)
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Greedy randomized adaptive search procedures
- A reactive GRASP and path relinking for a combined production-distribution problem
- Improving Discrete Model Representations via Symmetry Considerations
- A new approach to the minimum cut problem
- Solving capacitated clustering problems
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- The node capacitated graph partitioning problem: A computational study
- Min-cut clustering
- A GRASP for parallel machine scheduling with time windows
- Cliques and clustering: A combinatorial approach
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Greedy random adaptive memory programming search for the capacitated clustering problem
- The capacitated centred clustering problem
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- Genetic clustering algorithms.
- A GRASP for the Vehicle Routing Problem with Time Windows
- Title not available (Why is that?)
Cited In (13)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
- Tabu search and GRASP for the capacitated clustering problem
- A guided reactive GRASP for the capacitated multi-source Weber problem
- Model-based capacitated clustering with posterior regularization
- Heuristic search to the capacitated clustering problem
- Multi-neighborhood based path relinking for two-sided assembly line balancing problem
- Solving the capacitated clustering problem with variable neighborhood search
- Reactive GRASP for the strip-packing problem
- Local search algorithms for the composite retrieval problem
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- A matheuristic for large-scale capacitated clustering
- Capacitated clustering problems applied to the layout of IT-teams in software factories
- A random-key GRASP for combinatorial optimization
Uses Software
This page was built for publication: A reactive GRASP with path relinking for capacitated clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535394)
