A hybrid heuristic for the p-median problem
From MaRDI portal
Publication:1826490
Recommendations
Cited in
(75)- Exemplar-based clustering via simulated annealing
- GRASP and path relinking for the max-min diversity problem
- Fast primal and dual heuristics for the \(p\)-median location problem
- A dynamic programming heuristic for the \(P\)-median problem
- A heuristic for large-size p-median location problems with application to school location
- Making a state-of-the-art heuristic faster with data mining
- A robust and scalable algorithm for the Steiner problem in graphs
- A Lagrangian search method for the \(P\)-median problem
- A hybrid artificial bee colony algorithm for the p-median problem with positive/negative weights
- Median and covering location problems with interconnected facilities
- Hybrid adaptive large neighborhood search for the optimal statistic median problem
- Scatter search for the cutwidth minimization problem
- An aggregation heuristic for large scale p-median problem
- Some heuristic methods for solving p-median problems with a coverage constraint
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- A variable neighborhood search approach for the vertex bisection problem
- A novel ant colony optimization strategy for the quantum circuit compilation problem
- A multi-objective GRASP procedure for reactive power compensation planning
- A tighter formulation of the p-median problem
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem
- A fast swap-based local search procedure for location problems
- Metaheuristic applications on discrete facility location problems: a survey
- Solving the \(p\)-median problem on regular and lattice networks
- Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
- Hybridizations of GRASP with path relinking for the far from most string problem
- A computational study for the p-median problem
- GRASP with path relinking heuristics for the antibandwidth problem
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- A model for clustering data from heterogeneous dissimilarities
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- GRASP and path relinking for the equitable dispersion problem
- A GRASP metaheuristic for microarray data analysis
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Scatter search for an uncapacitated \(p\)-hub median problem
- New heuristic algorithms for solving the planar p-median problem
- scientific article; zbMATH DE number 3987006 (Why is no real title available?)
- A new heuristic approach for the P-median problem
- A branch decomposition algorithm for the p-median problem
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- Probabilistic stopping rules for GRASP heuristics and extensions
- Randomized heuristics for the family traveling salesperson problem
- An effective heuristic for the \(P\)-median problem with application to ambulance location
- Imposing contiguity constraints in political districting models
- Discrete facility location in machine learning
- Heuristic solution approaches for the maximum minsum dispersion problem
- Analyzing heuristic-based randomized search strategies for the quantum circuit compilation problem
- scientific article; zbMATH DE number 5590060 (Why is no real title available?)
- P-median problems with an additional constraint on the assignment variables
- Matheuristics for the capacitated p-Median problem
- Affinity propagation and uncapacitated facility location problems
- A sample approximation solution procedure for chance-constrained districting problems
- Configuration‐based approach for topological problems in the design of wireless sensor networks
- Approximation schemes for districting problems with probabilistic constraints
- An efficient Benders decomposition for the \(p\)-median problem
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
- Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
- Multiparent path relinking. An application to the power dominating set problem
- Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the \(\mathrm{p}\)-median problem
- A resonance neural network for the k-median problem
- Modeling and planning a novel logistic transport system: several drone pickups for each delivery
- Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- The \(p\)-median problem: a survey of metaheuristic approaches
- A genetic algorithm for the p-median problem with pos/neg weights
- Computational study of large-scale p-median problems
- A scatter search-based heuristic to locate capacitated transshipment points
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
This page was built for publication: A hybrid heuristic for the \(p\)-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826490)
