Computational study of large-scale p-median problems
From MaRDI portal
(Redirected from Publication:868446)
Recommendations
Cites work
- scientific article; zbMATH DE number 1187151 (Why is no real title available?)
- scientific article; zbMATH DE number 1560330 (Why is no real title available?)
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- 10.1162/153244303765208403
- A Dual-Bounded Algorithm for the p-Median Problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- A branch-and-price approach to p-median location problems
- A hybrid heuristic for the \(p\)-median problem
- A note on solving large p-median problems
- A statistical analysis of simulated annealing applied to the p-median problem
- A tree search algorithm for the p-median problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An efficient tabu search procedure for the \(p\)-median problem
- An exact algorithm for the maximum stable set problem
- Cluster Analysis and Mathematical Programming
- Cluster Analysis: An Application of Lagrangian Relaxation
- Cluster analysis and mathematical programming
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Geometric algorithms and combinatorial optimization.
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Integer Programming and the Theory of Grouping
- Lagrangean heuristics for location problems
- On the \(p\)-median polytope
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Stabilized column generation
- The Optimal Diversity Management Problem
- The parallel variable neighborhood search for the \(p\)-median problem
- The volume algorithm: Producing primal solutions with a subgradient method
- Variable neighborhood decomposition search
- Variable neighborhood search for the p-median
Cited in
(56)- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A branch-and-cut algorithm for the median-path problem
- Scenario Reduction Techniques in Stochastic Programming
- Discrete facility location in machine learning
- A computational study for the \(p\)-median problem
- scientific article; zbMATH DE number 3915986 (Why is no real title available?)
- Irregular polyomino tiling via integer programming with application in phased array antenna design
- Finding all pure strategy Nash equilibria in a planar location game
- K-medoids inverse regression
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- Exemplar-based clustering via simulated annealing
- Algorithms for the one-dimensional two-stage cutting stock problem
- On the \(p\)-median polytope of \(Y\)-free graphs
- Public service system design with fuzzy parameters of perceived utility
- A cutting plane algorithm for the capacitated facility location problem
- Affinity propagation and uncapacitated facility location problems
- Large neighborhood search for the \(p\)-median problem
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- A tighter formulation of the p-median problem
- Local search heuristics for the mobile facility location problem
- Semi-fair design of emergency service system with failing centers
- Discrete self-organizing migration algorithm and \(p\)-location problems
- Efficient incrementing heuristics for generalized \(p\)-location problems
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- An efficient Benders decomposition for the \(p\)-median problem
- A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation
- Using decomposition to improve greedy solutions of the optimal diversity management problem
- Near-optimal large-scale k-medoids clustering
- Complexity evaluation of benchmark instances for the \(p\)-median problem
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A note on solving large p-median problems
- Data aggregation for \(p\)-median problems
- The location-dispatching problem: polyhedral results and content delivery network design
- A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- A decomposition approach for the \(p\)-median problem on disconnected graphs
- Convex fuzzy \(k\)-medoids clustering
- 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
- Configuration‐based approach for topological problems in the design of wireless sensor networks
- A branch decomposition algorithm for the \(p\)-median problem
- An aggregation heuristic for large scale p-median problem
- The decomposition method for the \(p\)-median problem on a disconnected graph
- Some heuristic methods for solving p-median problems with a coverage constraint
- The directional \(p\)-median problem: definition, complexity, and algorithms
- A computational study of a nonlinear minsum facility location problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- The location-dispatching problem: polyhedral results and content delivery network design
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- An exact column-generation approach for the lot-type design problem
- Solving large \(p\)-median problems with a radius formulation
- Variable neighborhood search for minimum sum-of-squares clustering on networks
This page was built for publication: Computational study of large-scale \(p\)-median problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868446)
