Solution methods for thep-median problem: An annotated bibliography
From MaRDI portal
Publication:3423879
DOI10.1002/net.20128zbMath1133.90357MaRDI QIDQ3423879
No author found.
Publication date: 15 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20128
90B60: Marketing, advertising
90-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming
Related Items
An efficient algorithm for solving the median problem on real road networks, Discrete facility location in machine learning, A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations, Optimal algorithms for selective variants of the classical and inverse median location problems on trees, Median Problems in Networks, Bounds and convex heuristics for bi-objective optimal experiment design in water networks, An efficient Benders decomposition for the \(p\)-median problem, On statistical bounds of heuristic solutions to location problems, The connected \(p\)-median problem on block graphs, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, Optimal shift partitioning of pharmacies, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, An efficient heuristic algorithm for the capacitated \(p\)-median problem, On the linear relaxation of the \(p\)-median problem, A decomposition approach for facility location and relocation problem with uncertain number of future facilities, Data aggregation for \(p\)-median problems, Using dual feasible functions to construct fast lower bounds for routing and location problems, Threshold robustness in discrete facility location problems: a bi-objective approach, New genetic algorithms based approaches to continuous \(p\)-median problem, Complexity evaluation of benchmark instances for the \(p\)-median problem, Multiobjective optimization for multimode transportation problems, Confidence in heuristic solutions?, The linking set problem: a polynomial special case of the multiple-choice knapsack problem, A bi-objective approach to discrete cost-bottleneck location problems, A decomposition approach for the \(p\)-median problem on disconnected graphs, Discrete parallel machine makespan ScheLoc problem, Primal and dual bounds for the vertex \(p\)-median problem with balance constraints, On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs, A computational study of a nonlinear minsum facility location problem, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem, One-dimensional center-based l 1-clustering method, Most recent changepoint detection in censored panel data, A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems, \(k\)-means genetic algorithms with greedy genetic operators, A tighter formulation of the \(p\)-median problem, The problem of the optimal placing of the information-technological reserve in distributed data processing systems, Mathematical modeling and optimal blank generation in glass manufacturing, A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem, Variable neighborhood search for minimum sum-of-squares clustering on networks, The network \(p\)-median problem with discrete probabilistic demand weights, Step decision rules for multistage stochastic programming: a heuristic approach, Determining the best shipper sizes for sending products to customers, Using decomposition to improve greedy solutions of the optimal diversity management problem, A computational study for the p-median Problem, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, The most probable allocation solution for the p-median problem
Uses Software
Cites Work
