Pages that link to "Item:Q3423879"
From MaRDI portal
The following pages link to Solution methods for thep-median problem: An annotated bibliography (Q3423879):
Displayed 29 items.
- On statistical bounds of heuristic solutions to location problems (Q281793) (← links)
- The connected \(p\)-median problem on block graphs (Q315481) (← links)
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- Optimal shift partitioning of pharmacies (Q337411) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
- A decomposition approach for facility location and relocation problem with uncertain number of future facilities (Q439497) (← links)
- Data aggregation for \(p\)-median problems (Q491200) (← links)
- Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
- Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
- New genetic algorithms based approaches to continuous \(p\)-median problem (Q539099) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Confidence in heuristic solutions? (Q746822) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) (← 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)
- One-dimensional center-based l 1-clustering method (Q1936788) (← links)
- A tighter formulation of the \(p\)-median problem (Q2268764) (← links)
- A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (Q2339828) (← links)
- Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
- The network \(p\)-median problem with discrete probabilistic demand weights (Q2379654) (← links)
- Step decision rules for multistage stochastic programming: a heuristic approach (Q2440766) (← links)
- Determining the best shipper sizes for sending products to customers (Q2803267) (← links)
- Using decomposition to improve greedy solutions of the optimal diversity management problem (Q2862154) (← links)
- A computational study for the p-median Problem (Q2883594) (← links)
- Median Problems in Networks (Q5506718) (← links)