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 48 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)
- Multiobjective optimization for multimode transportation problems (Q721075) (← links)
- Confidence in heuristic solutions? (Q746822) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
- A decomposition approach for the \(p\)-median problem on disconnected graphs (Q1652380) (← links)
- Discrete parallel machine makespan ScheLoc problem (Q1679512) (← links)
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← 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)
- Most recent changepoint detection in censored panel data (Q1995859) (← links)
- A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems (Q2070119) (← links)
- \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
- A tighter formulation of the \(p\)-median problem (Q2268764) (← links)
- The problem of the optimal placing of the information-technological reserve in distributed data processing systems (Q2290424) (← links)
- Mathematical modeling and optimal blank generation in glass manufacturing (Q2336874) (← 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)
- Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
- The most probable allocation solution for the p-median problem (Q3389552) (← links)
- An efficient algorithm for solving the median problem on real road networks (Q5059369) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)
- A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068) (← links)
- Median Problems in Networks (Q5506718) (← links)
- Bounds and convex heuristics for bi-objective optimal experiment design in water networks (Q6164379) (← links)
- An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)