Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
From MaRDI portal
Publication:6066720
Recommendations
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Variable neighborhood search for the p-median
- The parallel variable neighborhood search for the \(p\)-median problem
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- A branch-and-cut method for the obnoxious \(p\)-median problem
- Alternative formulations for the obnoxious \(p\)-median problem
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- A revised variable neighborhood search for the discrete ordered median problem
Cites work
- A branch-and-cut method for the obnoxious \(p\)-median problem
- A new adaptive multi-start technique for combinatorial global optimizations
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- First vs. best improvement: an empirical study
- Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems
- Obnoxious Facility Location on Graphs
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- Solving the capacitated clustering problem with variable neighborhood search
- The \(p\)-median problem: a survey of metaheuristic approaches
- The obnoxious p facility network location problem with facility interaction
- Variable neighborhood search
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
- Variable neighborhood search for the p-median
- Variable neighborhood search: basics and variants
- Variable neighbourhood search: methods and applications
Cited in
(29)- Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
- Variable neighborhood programming for symbolic regression
- An efficient heuristic for a hub location routing problem
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
- Less is more approach in optimization: a road to artificial intelligence
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
- A variable neighborhood search algorithm for an integrated physician planning and scheduling problem
- Variable neighborhood search for the p-median
- Variable Neighborhood Programming as a Tool of Machine Learning
- Fat-tailed distributions for continuous variable neighborhood search
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
- The uncapacitated r‐allocation p‐hub center problem
- A variable neighborhood search for flying sidekick traveling salesman problem
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
- An efficient implementation of a VNS heuristic for the weighted fair sequences problem
- The obnoxious competitive facility location model
- Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak
- Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm
- A parallel variable neighborhood search for -neighbor facility location problems
- A matheuristic for locating obnoxious facilities
- A variable neighborhood search for the median location problem with interconnected facilities
- An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem
- First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim
- GRASP and VNS approaches for a vehicle routing problem with step cost functions
- A VNS method for the conditional p-next center problem
- An efficient probability-based VNS algorithm for delivery territory design
- Dispersed starting solutions in facility location: the case of the planar p-median problem
- Simultaneous convexification for the planar obnoxious facility location problem
This page was built for publication: Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6066720)
