Pages that link to "Item:Q4474299"
From MaRDI portal
The following pages link to Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299):
Displaying 14 items.
- Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
- When centers can fail: a close second opportunity (Q337641) (← links)
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem (Q954046) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
- An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
- A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff (Q2514827) (← links)
- Insertion heuristics for central cycle problems (Q3057168) (← links)
- Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
- The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique (Q4987796) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
- Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)
