Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
From MaRDI portal
Publication:4422624
DOI10.1002/net.10081zbMath1036.90046OpenAlexW2094078700MaRDI QIDQ4422624
Pierre Hansen, Nenad Mladenović, Martine Labbé
Publication date: 20 August 2003
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10081
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
The mixed center location problem, The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory, A revised variable neighborhood search for the discrete ordered median problem, Inequity averse optimization in operational research, Capacitated \(p\)-center problem with failure foresight, A bibliography for some fundamental problem categories in discrete location science, Location of Emergency Facilities with Uncertainty in the Demands, When centers can fail: a close second opportunity, The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic, The multi-period \(p\)-center problem with time-dependent travel times, Ambulance location and relocation problems with time-dependent travel times, GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem, Location Science in Canada, Dynamically second-preferred \(p\)-center problem, Bee colony optimization for the \(p\)-center problem, The complete vertex \(p\)-center problem, GRASP and VNS for solving the \(p\)-next center problem, Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles, A two-stage robust model for a reliable \(p\)-center facility location problem, New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems, A modified variable neighborhood search for the discrete ordered median problem, A location-routing problem in glass recycling, Variable neighbourhood search: methods and applications, An exact algorithm for the capacitated vertex \(p\)-center problem, Insertion heuristics for central cycle problems, Multiobjective optimization for multimode transportation problems, A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff, Data Exploration by Representative Region Selection: Axioms and Convergence, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, Norm statistics and the complexity of clustering problems, Optimal location with equitable loads, Variable neighbourhood search: Methods and applications, Less is more approach in optimization: a road to artificial intelligence, The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique, A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location, An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants, Heuristic procedures for solving the discrete ordered median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the maximum satisfiability problem
- A simple heuristic for the p-centre problem
- A note on solving large p-median problems
- A heuristic for the p-center problem in graphs
- A new adaptive multi-start technique for combinatorial global optimizations
- Variable neighborhood search
- Variable neighborhood decomposition search
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- The p-Centre Problem-Heuristic and Optimal Algorithms
- A Best Possible Heuristic for the k-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- TSPLIB—A Traveling Salesman Problem Library
- Tabu Search—Part I
- Tabu Search—Part II
- Variable neighborhood search for the p-median
- The m-Center Problem
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
