Pages that link to "Item:Q864013"
From MaRDI portal
The following pages link to The \(p\)-median problem: a survey of metaheuristic approaches (Q864013):
Displaying 50 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- Models and algorithms for competitive facility location problems with different customer behavior (Q276530) (← links)
- A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage (Q286207) (← links)
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Strengthening the reliability fixed-charge location model using clique constraints (Q337553) (← links)
- A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
- A mixed integer nonlinear programming model and heuristic solutions for location, inventory and pricing decisions in a closed loop supply chain (Q342123) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem (Q463377) (← links)
- Data aggregation for \(p\)-median problems (Q491200) (← links)
- Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem (Q524886) (← links)
- Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases (Q526417) (← links)
- New genetic algorithms based approaches to continuous \(p\)-median problem (Q539099) (← links)
- An exact procedure and LP formulations for the leader-follower location problem (Q611000) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- The heterogeneous \(p\)-median problem for categorization based clustering (Q692416) (← links)
- Multiobjective optimization for multimode transportation problems (Q721075) (← links)
- A 16-competitive algorithm for hierarchical median problem (Q893690) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- Multiple voting location problems (Q933517) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Local improvement in planar facility location using vehicle routing (Q1026598) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Exemplar-based clustering via simulated annealing (Q1036142) (← links)
- Optimal column subset selection for image classification by genetic algorithms (Q1621645) (← links)
- Generalization of the restricted planar location problems: unified metaheuristic algorithms (Q1654346) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
- Discrete parallel machine makespan ScheLoc problem (Q1679512) (← links)
- A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights (Q1684321) (← links)
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
- Variations in the flow approach to CFCLP-TC for multiobjective supply chain design (Q1719200) (← links)
- A facility location model for air pollution detection (Q1720454) (← links)
- A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) (← links)
- An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms (Q1788861) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
- Does Euclidean distance work well when the \(p\)-median model is applied in rural areas? (Q1945072) (← links)
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
- An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
- Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments (Q2005789) (← links)
