Large-scale local search heuristics for the capacitated vertexp-center problem
From MaRDI portal
Publication:4474299
Recommendations
- Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
Cites work
- A Lagrangean heuristic for the maximal covering location problem
- A class of greedy algorithms for the generalized assignment problem
- A column generation approach to capacitated \(p\)-median problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- How to Allocate Network Centers
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- Network flows. Theory, algorithms, and applications.
- Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
- The Capacitated K-Center Problem
Cited in
(20)- The capacitated single-source \(p\)-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff
- An exact algorithm for the capacitated vertex \(p\)-center problem
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
- A Survey of the Generalized Assignment Problem and Its Applications
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- Exact solution approaches for the discrete α‐neighbor p‐center problem
- Insertion heuristics for central cycle problems
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
- Dynamically second-preferred \(p\)-center problem
- Integrating heuristic information into exact methods: the case of the vertex \(p\)-centre problem
- Diversification strategies in local search for a nonbifurcated network loading problem
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- Capacitated \(p\)-center problem with failure foresight
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- A variable neighbourhood search method for solving the long-term care facility location problem
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
- When centers can fail: a close second opportunity
This page was built for publication: Large-scale local search heuristics for the capacitated vertexp-center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474299)
