Heuristic concentration and tabu search: A head to head comparison
From MaRDI portal
(Redirected from Publication:1291635)
Recommendations
- Heuristic concentration for the p-median: An example demonstrating how and why it works
- A gamma heuristic for the \(p\)-median problem
- Heuristic concentration: Two stage solution construction
- An efficient tabu search procedure for the p-median problem
- Solving the maximal covering location problem with heuristic concentration
Cites work
- An efficient tabu search procedure for the p-median problem
- Facility siting and integer-friendly programming
- Future paths for integer programming and links to artificial intelligence
- General local search methods
- Heuristic concentration: Two stage solution construction
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- scientific article; zbMATH DE number 151868 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Tabu Search—Part I
- Tabu Search—Part II
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
Cited in
(16)- Exemplar-based clustering via simulated annealing
- Heuristic concentration: Two stage solution construction
- The design of reverse distribution networks: Models and solution procedures
- Heuristic concentration for the p-median: An example demonstrating how and why it works
- Hybrid heuristics for examination timetabling problem
- Location analysis: a synthesis and survey
- A gamma heuristic for the \(p\)-median problem
- Comparison of metaheuristic algorithms for examination timetabling problem
- Integrating location and network restoration decisions in relief networks under uncertainty
- Solving the maximal covering location problem with heuristic concentration
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- Variable neighborhood search: Principles and applications
- A conditional p-hub location problem with attraction functions
- The \(p\)-median problem: a survey of metaheuristic approaches
- Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles
- The heuristic concentration-integer and its application to a class of location problems
This page was built for publication: Heuristic concentration and tabu search: A head to head comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291635)
